Gauss-Newton-type methods for bilevel optimization
From MaRDI portal
Publication:2028474
DOI10.1007/s10589-020-00254-3zbMath1469.90138arXiv2003.03128OpenAlexW3118740517WikidataQ114227029 ScholiaQ114227029MaRDI QIDQ2028474
Andrey Tin, Jörg Fliege, Alain B. Zemkoho
Publication date: 1 June 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.03128
Related Items
Extension of the value function reformulation to multiobjective bilevel optimization, Linearly convergent bilevel optimization with single-step inner methods, Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization, A primal nonsmooth reformulation for bilevel optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- 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?
- A smoothing augmented Lagrangian method for solving simple bilevel programs
- The semismooth approach for semi-infinite programming under the reduction ansatz
- Global solution of bilevel programs with a nonconvex inner program
- On NCP-functions
- Practical bilevel optimization. Algorithms and applications
- A bundle algorithm applied to bilevel programming problems with non-unique lower level solutions
- Foundations of bilevel programming
- On an algorithm solving two-level programming problems with nonunique lower level solutions
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- Numerically tractable optimistic bilevel problems
- Using low-rank approximation of the Jacobian matrix in the Newton-Raphson method to solve certain singular equations
- Application of particle swarm optimization based on CHKS smoothing function for solving nonlinear bilevel programming problem
- On solving simple bilevel programs with a nonconvex lower level program
- Optimization theory and methods. Nonlinear programming
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- The Semismooth Approach for Semi-Infinite Programming without Strict Complementarity
- Numerical Optimization
- A special newton-type optimization method
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Jacobian Smoothing Methods for Nonlinear Complementarity Problems
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Optimality conditions for bilevel programming problems
- BOLIB: Bilevel Optimization LIBrary of Test Problems
- Pessimistic Bilevel Optimization
- New necessary optimality conditions in optimistic bilevel programming
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- Generalized inverse methods for the best least squares solution of systems of non-linear equations
