A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization
From MaRDI portal
Publication:5158762
DOI10.1137/20M1352375OpenAlexW3204405701MaRDI QIDQ5158762
Jane J. Ye, Li Wang, Suhan Zhong, Jia-Wang Nie
Publication date: 26 October 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.07933
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Semi-infinite programming (90C34)
Related Items (7)
Generic Property of the Partial Calmness Condition for Bilevel Programming Problems ⋮ An Improved Unconstrained Approach for Bilevel Optimization ⋮ Rational Generalized Nash Equilibrium Problems ⋮ A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization ⋮ Hausdorff distance between convex semialgebraic sets ⋮ Convex generalized Nash equilibrium problems and polynomial optimization ⋮ Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solution algorithm for an optimistic linear Stackelberg problem
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- A smoothing augmented Lagrangian method for solving simple bilevel programs
- The deregulated electricity market viewed as a bilevel programming problem
- Global solution of bilevel programs with a nonconvex inner program
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Practical bilevel optimization. Algorithms and applications
- A global optimization method for solving convex quadratic bilevel programming problems
- A bridge between bilevel programs and Nash games
- Solving bilevel programs with the KKT-approach
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs
- Bilevel optimization. Advances and next challenges
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- A bounded degree SOS hierarchy for polynomial optimization
- Certifying convergence of Lasserre's hierarchy via flat truncation
- On solving simple bilevel programs with a nonconvex lower level program
- An overview of bilevel optimization
- Global Optimization with Polynomials and the Problem of Moments
- Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems
- Sensitivity Analysis of the Value Function for Parametric Mathematical Programs with Equilibrium Constraints
- New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
- Semi-Infinite Programming: Theory, Methods, and Applications
- On the numerical solution of a class of Stackelberg problems
- GloptiPoly 3: moments, optimization and semidefinite programming
- Computational Difficulties of Bilevel Linear Programming
- Critical sets in parametric optimization
- A new computational method for Stackelberg and min-max problems by use of a penalty method
- Differential properties of the marginal function in mathematical programming
- The Theory of Moral Hazard and Unobservable Behaviour: Part I
- On Optimization Problems with Variational Inequality Constraints
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Optimality conditions for bilevel programming problems
- Constraint Qualifications and Optimality Conditions in Bilevel Optimization
- Directional Necessary Optimality Conditions for Bilevel Programs
- Bilevel Programming Problems
- Bilevel Polynomial Programs and Semidefinite Relaxation Methods
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- Classification model selection via bilevel programming
- Mathematical Programs with Equilibrium Constraints
- Solving a Huff-like Stackelberg location problem on networks
This page was built for publication: A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization
