Generalized semi-infinite polynomial optimization and semidefinite programming relaxations

DOI10.1007/s40306-024-00551-7MaRDI QIDQ6650707

Tiên Sȯn Phạm, Liguo Jiao, Jae Hyoung Lee

Publication date: 9 December 2024

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

zbMATH Keywords

polynomial optimizationgeneralized semi-infinite programmingLasserre hierarchies

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Polynomial optimization (90C23)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Min-max and robust polynomial optimization
• Generalized semi-infinite programming: a tutorial
• The \(K\)-moment problem for compact semi-algebraic sets
• Generalized semi-infinite optimization: A first order optimality condition and examples
• Semidefinite programming relaxations for semialgebraic problems
• An algorithm for semi-infinite polynomial optimization
• Global Optimization with Polynomials and the Problem of Moments
• Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems
• Genericity in Polynomial Optimization
• A “Joint+Marginal” Approach to Parametric Polynomial Optimization
• General Semi-Infinite Programming: Symmetric Mangasarian–Fromovitz Constraint Qualification and the Closure of the Feasible Set
• General semi-infinite programming: critical point theory
• GloptiPoly 3: moments, optimization and semidefinite programming
• Semidefinite Programming

This page was built for publication: Generalized semi-infinite polynomial optimization and semidefinite programming relaxations