Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization
From MaRDI portal
Publication:6173804
DOI10.1007/s11081-022-09736-1arXiv2101.09521OpenAlexW3123054681MaRDI QIDQ6173804
Publication date: 13 July 2023
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.09521
Levenberg-Marquardt methodpartial calmnessbilevel optimizationvalue function reformulationpartial exact penalization parameter
Mathematical programming (90Cxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Techniques for gradient-based bilevel optimization with non-smooth lower level problems
- An interior point technique for solving bilevel programming problems
- Solution of a truss topology bilevel programming problem by means of an inexact restoration method
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Efficiently solving linear bilevel programming problems using off-the-shelf optimization software
- A smoothing augmented Lagrangian method for solving simple bilevel programs
- Global solution of bilevel programs with a nonconvex inner program
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- Gauss-Newton-type methods for bilevel optimization
- Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization
- Numerically tractable optimistic bilevel problems
- On solving simple bilevel programs with a nonconvex lower level program
- An Exact Penalization Viewpoint of Constrained Optimization
- An Ideal Penalty Function for Constrained Optimization
- Numerical Optimization
- A special newton-type optimization method
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Exact Penalty Functions in Constrained Optimization
- Optimality conditions for bilevel programming problems
- A Bilevel Programming Method for Pipe Network Optimization
- BOLIB: Bilevel Optimization LIBrary of Test Problems
- Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
- Pessimistic Bilevel Optimization
- On the constrained error bound condition and the projected Levenberg–Marquardt method
- New necessary optimality conditions in optimistic bilevel programming
