On penalty-based bilevel gradient descent method
From MaRDI portal
Numerical methods based on nonlinear programming (49M37) Analysis of algorithms and problem complexity (68Q25) Large-scale problems in mathematical programming (90C06) Stochastic programming (90C15) Nonconvex programming, global optimization (90C26) Abstract computational complexity for mathematical programming problems (90C60)
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first order method for solving convex bilevel optimization problems
- A Two-Timescale Stochastic Algorithm Framework for Bilevel Optimization: Complexity Analysis and Application to Actor-Critic
- An overview of bilevel optimization
- Bilevel and multilevel programming: A bibliography review
- Bilevel Methods for Image Reconstruction
- Constraint qualifications and optimality conditions in bilevel optimization
- Cubic regularization of Newton method and its global performance
- Descent approaches for quadratic bilevel programming
- Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
- Efficiency of minimizing compositions of convex functions and smooth maps
- Error bounds, quadratic growth, and linear convergence of proximal methods
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 3823524 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- Implicit Functions and Solution Mappings
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Learning with Limited Samples: Meta-Learning and Applications to Communication Systems
- Loss landscapes and optimization in over-parameterized non-linear systems and neural networks
- Mathematical Programs with Equilibrium Constraints
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches
- On bilevel programming. I: General nonlinear cases
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
- Optimality conditions for bilevel programming problems
- Optimality conditions for bilevel programming problems
- Proximal methods avoid active strict saddles of weakly convex functions
- Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
This page was built for publication: On penalty-based bilevel gradient descent method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6885414)
