Gauss-Newton-type methods for bilevel optimization
From MaRDI portal
Publication:2028474
Abstract: This article studies Gauss-Newton-type methods for over-determined systems to find solutions to bilevel programming problems. To proceed, we use the lower-level value function reformulation of bilevel programs and consider necessary optimality conditions under appropriate assumptions. First under strict complementarity for upper- and lower-level feasibility constraints, we prove the convergence of a Gauss-Newton-type method in computing points satisfying these optimality conditions under additional tractable qualification conditions. Potential approaches to address the shortcomings of the method are then proposed, leading to alternatives such as the pseudo or smoothing Gauss-Newton-type methods for bilevel optimization. Our numerical experiments conducted on 124 examples from the recently released Bilevel Optimization LIBrary (BOLIB) compare the performance of our method under different scenarios and show that it is a tractable approach to solve bilevel optimization problems with continuous variables.
Recommendations
- Bilevel optimization: reformulation and first optimality conditions
- Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
- scientific article; zbMATH DE number 2068075
- Global optimization algorithm for solving bilevel programming problems with quadratic lower levels
- On the solution of convex bilevel optimization problems
Cites work
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 852532 (Why is no real title available?)
- scientific article; zbMATH DE number 1421091 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A bundle algorithm applied to bilevel programming problems with non-unique lower level solutions
- A smoothing augmented Lagrangian method for solving simple bilevel programs
- A special newton-type optimization method
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- Application of particle swarm optimization based on CHKS smoothing function for solving nonlinear bilevel programming problem
- BOLIB: bilevel Optimization LIBrary of test problems
- 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
- Foundations of bilevel programming
- Generalized inverse methods for the best least squares solution of systems of non-linear equations
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Global solution of bilevel programs with a nonconvex inner program
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Jacobian Smoothing Methods for Nonlinear Complementarity Problems
- New necessary optimality conditions in optimistic bilevel programming
- Numerical Optimization
- Numerically tractable optimistic bilevel problems
- On NCP-functions
- On an algorithm solving two-level programming problems with nonunique lower level solutions
- On solving simple bilevel programs with a nonconvex lower level program
- Optimality conditions for bilevel programming problems
- Optimization theory and methods. Nonlinear programming
- Pessimistic bilevel optimization
- Practical bilevel optimization. Algorithms and applications
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- The semismooth approach for semi-infinite programming under the reduction ansatz
- The semismooth approach for semi-infinite programming without strict complementarity
- Using low-rank approximation of the Jacobian matrix in the Newton-Raphson method to solve certain singular equations
Cited in
(7)- Extension of the value function reformulation to multiobjective bilevel optimization
- Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization
- An accelerated inexact Newton-type regularizing algorithm for ill-posed operator equations
- Linearly convergent bilevel optimization with single-step inner methods
- scientific article; zbMATH DE number 7774549 (Why is no real title available?)
- Nonconvex quasi-variational inequalities: stability analysis and application to numerical optimization
- A primal nonsmooth reformulation for bilevel optimization problems
This page was built for publication: Gauss-Newton-type methods for bilevel optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028474)
