Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems

DOI10.1007/s10479-022-05103-6zbMath1503.90087OpenAlexW4310092690MaRDI QIDQ2678586

Ya-Ping Fang, La Huang, Danyang Liu

Publication date: 23 January 2023

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-022-05103-6

zbMATH Keywords

convergenceoptimality conditionsrobust optimizationconvex polynomialSDP relaxations

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34) Robustness in mathematical programming (90C17) Polynomial optimization (90C23)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality conditions and finite convergence of Lasserre's hierarchy
• On general minimax theorems
• The \(K\)-moment problem for compact semi-algebraic sets
• Robust convex quadratically constrained programs
• Sums of squares on real algebraic curves
• A Frank--Wolfe type theorem for convex polynomial programs
• Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
• On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
• Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
• Robust optimization-methodology and applications
• Some geometric results in semidefinite programming
• Exact SDP relaxations for classes of nonlinear semidefinite programming problems
• Robust SOS-convex polynomial optimization problems: exact SDP relaxations
• Distinguished representations of non-negative polynomials
• Global Optimization with Polynomials and the Problem of Moments
• Robust Convex Optimization
• WHAT IS...a Spectrahedron?
• On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
• Theory and Applications of Robust Optimization
• Convexity in SemiAlgebraic Geometry and Polynomial Optimization
• A new class of alternative theorems for SOS-convex inequalities and robust optimization
• Generic Properties for Semialgebraic Programs
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

This page was built for publication: Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems