Bilevel polynomial programs and semidefinite relaxation methods
From MaRDI portal
Abstract: A bilevel program is an optimization problem whose constraints involve another optimization problem. This paper studies bilevel polynomial programs (BPPs), i.e., all the functions are polynomials. We reformulate BPPs equivalently as semi-infinite polynomial programs (SIPPs), using Fritz John conditions and Jacobian representations. Combining the exchange technique and Lasserre type semidefinite relaxations, we propose numerical methods for solving both simple and general BPPs. For simple BPPs, we prove the convergence to global optimal solutions. Numerical experiments are presented to show the efficiency of proposed algorithms.
Recommendations
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- A Lagrange multiplier expression method for bilevel polynomial optimization
- A computational study for bilevel quadratic programs using semidefinite relaxations
- Parametric global optimization for polynomial bilevel programming
- A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
Cites work
- A smoothing augmented Lagrangian method for solving simple bilevel programs
- An exact Jacobian SDP relaxation for polynomial optimization
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Characterization of optimality in convex programming without a constraint qualification
- Computational Difficulties of Bilevel Linear Programming
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- Convex two-level optimization
- Foundations of bilevel programming
- 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
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3791104 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- Infinitely 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
- New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- On solving simple bilevel programs with a nonconvex lower level program
- On the numerical solution of a class of Stackelberg problems
- On the solution of convex bilevel optimization problems
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Optimality conditions for bilevel programming problems
- Optimization and nonsmooth analysis
- Optimization over polynomials: selected topics
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semidefinite relaxations for semi-infinite polynomial programming
- Sensitivity analysis of the value function for parametric mathematical programs with equilibrium constraints
- Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- Solving bilevel programs with the KKT-approach
- The Theory of Moral Hazard and Unobservable Behaviour: Part I
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(21)- A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
- Separating tight metric inequalities by bilevel programming
- Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints
- Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- Parametric global optimization for polynomial bilevel programming
- A computational study for bilevel quadratic programs using semidefinite relaxations
- On applications of Wu's method in bilevel-programming problems
- Semidefinite relaxation for linear programs with equilibrium constraints
- BOLIB: bilevel Optimization LIBrary of test problems
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Generic property of the partial calmness condition for bilevel programming problems
- A Lagrange multiplier expression method for bilevel polynomial optimization
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
- Convergences for robust bilevel polynomial programmes with applications
- A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming
- Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling
- Geometric and computational hardness of bilevel programming
- Optimality conditions for bilevel programmes via Moreau envelope reformulation*
- Solving polynomial variational inequality problems via Lagrange multiplier expressions and moment-SOS relaxations
- Border basis relaxation for polynomial optimization
This page was built for publication: Bilevel polynomial programs and semidefinite relaxation methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348472)
