Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
From MaRDI portal
Abstract: In this paper, we consider a bilevel polynomial optimization problem where the objective and the constraint functions of both the upper and the lower level problems are polynomials. We present methods for finding its global minimizers and global minimum using a sequence of semidefinite programming (SDP) relaxations and provide convergence results for the methods. Our scheme for problems with a convex lower-level problem involves solving a transformed equivalent single-level problem by a sequence of SDP relaxations; whereas our approach for general problems involving a non-convex polynomial lower-level problem solves a sequence of approximation problems via another sequence of SDP relaxations.
Recommendations
- Bilevel polynomial programs and semidefinite relaxation methods
- A Lagrange multiplier expression method for bilevel polynomial optimization
- A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
- A computational study for bilevel quadratic programs using semidefinite relaxations
- Parametric global optimization for polynomial bilevel programming
Cites work
- A ``joint+marginal approach to parametric polynomial optimization
- Algorithm 920: SFSDP: a sparse version of full semidefinite programming relaxation for sensor network localization problems
- Alternative theorems for quadratic inequality systems and global quadratic optimization
- An overview of bilevel optimization
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Bilevel and multilevel programming: A bibliography review
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
- Existence theorems of equilibrium points in stackelberg
- Exponentiation is Hard to Avoid
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Foundations of bilevel programming
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Geometric categories and o-minimal structures
- Global optimization of nonlinear bilevel programming problems
- Global optimization with polynomials and the problem of moments
- Global solution of bilevel programs with a nonconvex inner program
- GloptiPoly 3: moments, optimization and semidefinite programming
- Handbook of test problems in local and global optimization
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1764082 (Why is no real title available?)
- scientific article; zbMATH DE number 6846220 (Why is no real title available?)
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Links between linear bilevel and mixed 0-1 programming problems
- Min-max and robust polynomial optimization
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
- New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches
- New results on approximate solution in two-level optimization
- On polynomial optimization over non-compact semi-algebraic sets
- On representations of the feasible set in convex optimization
- On solving simple bilevel programs with a nonconvex lower level program
- Optimization and nonsmooth analysis
- Optimization of Polynomials on Compact Semialgebraic Sets
- Pessimistic bilevel optimization
- Practical bilevel optimization. Algorithms and applications
- Semianalytic and subanalytic sets
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
- Semidefinite programming relaxations and algebraic optimization in control
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(19)- A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
- Optimality conditions for nonsmooth multiobjective bilevel optimization problems
- Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints
- A computational study for bilevel quadratic programs using semidefinite relaxations
- Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition
- Bilevel optimization: theory, algorithms, applications and a bibliography
- On the Role of a Market Maker in Networked Cournot Competition
- Exact conic programming relaxations for a class of convex polynomial cone programs
- A Lagrange multiplier expression method for bilevel polynomial optimization
- Bilevel polynomial programs and semidefinite relaxation methods
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
- Convergences for robust bilevel polynomial programmes with applications
- A utopia point method-based robust vector polynomial optimization scheme
- A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming
- Semi-definite programming and quantum information
- Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling
- Generalized semi-infinite polynomial optimization and semidefinite programming relaxations
- Geometric and computational hardness of bilevel programming
- Solving polynomial variational inequality problems via Lagrange multiplier expressions and moment-SOS relaxations
This page was built for publication: Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796798)
