Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems
From MaRDI portal
Publication:2796798
DOI10.1137/15M1017922zbMath1333.90088arXiv1506.02099WikidataQ59241432 ScholiaQ59241432MaRDI QIDQ2796798
Guoyin Li, Tiên Sȯn Phạm, Jean-Bernard Lasserre, Vaithilingam Jeyakumar
Publication date: 30 March 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.02099
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Semialgebraic sets and related spaces (14P10)
Related Items
Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints, Optimality conditions for nonsmooth multiobjective bilevel optimization problems, Bilevel Polynomial Programs and Semidefinite Relaxation Methods, Convergences for robust bilevel polynomial programmes with applications, On the Role of a Market Maker in Networked Cournot Competition, A utopia point method-based robust vector polynomial optimization scheme, A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming, Exact conic programming relaxations for a class of convex polynomial cone programs, A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization, Unnamed Item, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
- Farkas' lemma: three decades of generalizations for mathematical optimization
- On polynomial optimization over non-compact semi-algebraic sets
- Min-max and robust polynomial optimization
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
- On representations of the feasible set in convex optimization
- Global solution of bilevel programs with a nonconvex inner program
- Semianalytic and subanalytic sets
- Handbook of test problems in local and global optimization
- Practical bilevel optimization. Algorithms and applications
- Bilevel and multilevel programming: A bibliography review
- Links between linear bilevel and mixed 0-1 programming problems
- Foundations of bilevel programming
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
- Geometric categories and o-minimal structures
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- On solving simple bilevel programs with a nonconvex lower level program
- An overview of bilevel optimization
- Semidefinite programming relaxations and algebraic optimization in control
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Global Optimization with Polynomials and the Problem of Moments
- Algorithm 920
- New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
- A “Joint+Marginal” Approach to Parametric Polynomial Optimization
- GloptiPoly 3: moments, optimization and semidefinite programming
- Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
- Optimization and nonsmooth analysis
- Existence theorems of equilibrium points in stackelberg
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Exponentiation is Hard to Avoid
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- New results on approximate solution in two-level optimization
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Pessimistic Bilevel Optimization
- Optimization of Polynomials on Compact Semialgebraic Sets
- Global optimization of nonlinear bilevel programming problems
