Bilevel Polynomial Programs and Semidefinite Relaxation Methods
DOI10.1137/15M1052172zbMath1371.65058arXiv1508.06985MaRDI QIDQ5348472
Jia-Wang Nie, Jane J. Ye, Li Wang
Publication date: 18 August 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.06985
convergencenumerical experimentsemi-infinite programmingLasserre relaxationexchange methodFritz John conditionJacobian representationsemidefinitebilevel polynomial program
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Semi-infinite programming (90C34)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the solution of convex bilevel optimization problems
- 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?
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
- A smoothing augmented Lagrangian method for solving simple bilevel programs
- Global solution of bilevel programs with a nonconvex inner program
- Convex two-level optimization
- Infinitely constrained optimization problems
- Characterization of optimality in convex programming without a constraint qualification
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Foundations of bilevel programming
- An exact Jacobian SDP relaxation for polynomial optimization
- Solving bilevel programs with the KKT-approach
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Semidefinite relaxations for semi-infinite polynomial programming
- On solving simple bilevel programs with a nonconvex lower level program
- 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
- Optimization and nonsmooth analysis
- The Theory of Moral Hazard and Unobservable Behaviour: Part I
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Optimality conditions for bilevel programming problems
- Bilevel Programming Problems
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
This page was built for publication: Bilevel Polynomial Programs and Semidefinite Relaxation Methods