An Improved Unconstrained Approach for Bilevel Optimization
From MaRDI portal
Publication:6076870
DOI10.1137/22m1513034zbMath1526.65022arXiv2208.00732OpenAlexW4387601958MaRDI QIDQ6076870
Xin Liu, Kim-Chuan Toh, Xiao-Yin Hu, Nachuan Xiao
Publication date: 17 October 2023
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.00732
nonsmooth optimizationRiemannian manifoldsubgradient methodpenalty functionbilevel optimizationconservative field
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- Unnamed Item
- Unnamed Item
- On stochastic gradient and subgradient methods with adaptive steplength sequences
- Geometric categories and o-minimal structures
- Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games
- Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning
- Convergence of constant step stochastic gradient descent for non-smooth non-convex functions
- A brief introduction to manifold optimization
- A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming
- Stochastic subgradient method converges on tame functions
- Random gradient-free minimization of convex functions
- An overview of bilevel optimization
- A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
- Randomized Smoothing for Stochastic Optimization
- New Branch-and-Bound Rules for Linear Bilevel Programming
- OnActor-Critic Algorithms
- An Introduction to Optimization on Smooth Manifolds
- Sample Complexity of Sample Average Approximation for Conditional Stochastic Optimization
- A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization
- An Inertial Newton Algorithm for Deep Learning
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
- Approximating Subdifferentials by Random Sampling of Gradients
- Solving Stochastic Compositional Optimization is Nearly as Easy as Solving Stochastic Optimization
- A Two-Timescale Stochastic Algorithm Framework for Bilevel Optimization: Complexity Analysis and Application to Actor-Critic
