No article text was recorded for this version.
non-convex bilevel optimization (lower-level convexity assumption)
Version 1 of 115 papers16 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Achieving $\mathcal{O}(\epsilon^{-1.5})$ Complexity in Hessian/Jacobian-free Stochastic Bilevel Optimization
- Blog: An accelerated proximal algorithm for regularized nonconvex and nonsmooth bi-level optimization
- Blog: Federated Stochastic Bilevel Optimization with Fully First-Order Gradients
- Blog: A Value-Function-based Interior-point Method for Non-convex Bi-level Optimization
- Blog: TSP: A Two-Sided Smoothed Primal-Dual Method for Nonconvex Bilevel Optimization
- Blog: A Value-Function-based Interior-point Method for Non-convex Bi-level Optimization
- Blog: First-Order Federated Bilevel Learning
- Blog: Alternating Projected SGD for Equality-constrained Bilevel Optimization
- Blog: On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization
- Blog: Hessian Free Efficient Single Loop Iterative Differentiation Methods for Bi-Level Optimization Problems
- Blog: Averaged Method of Multipliers for Bi-Level Optimization without Lower-Level Strong Convexity
- Blog: Bilevel Optimization with Coupled Decision-Dependent Distributions
- Blog: Problem-Parameter-Free Decentralized Bilevel Optimization
- Blog: Achieving O(ε-1.5) Complexity in Hessian/Jacobian-free Stochastic Bilevel Optimization
- Blog: Moreau Envelope for Nonconvex Bi-Level Optimization: A Single-Loop and Hessian-Free Solution Strategy
History & citation
Current · Permanent link
- This direction split from single-loop bilevel optimization (67% overlap)
- This direction split from Non-Convex Bilevel Optimization Beyond Strong Convexity (100% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_non_convex_bilevel_optimization_lower_le_b68d4eca,
title = {non-convex bilevel optimization (lower-level convexity assumption)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/non-convex-bilevel-optimization-lower-level-convexity-assumption/rdr_b68d4ecad831471e849d418c9a248738},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_non_convex_bilevel_optimization_lower_le_b68d4eca_v1,
title = {non-convex bilevel optimization (lower-level convexity assumption)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/non-convex-bilevel-optimization-lower-level-convexity-assumption/rdr_b68d4ecad831471e849d418c9a248738/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}