Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
From MaRDI portal
Publication:1740163
DOI10.1016/j.amc.2017.07.076zbMath1426.90242OpenAlexW2755386969MaRDI QIDQ1740163
Thai Doan Chuong, Vaithilingam Jeyakumar
Publication date: 29 April 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2017.07.076
approximationsemi-infinite optimizationrelaxation problempolynomial programsemidefinite linear program
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items
Second-order cone programming relaxations for a class of multiobjective convex polynomial problems ⋮ Conic linear programming duals for classes of quadratic semi-infinite programs with applications ⋮ Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems ⋮ Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems ⋮ Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications ⋮ Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
- On general minimax theorems
- Semidefinite representation of convex sets
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
- Sums of squares on real algebraic curves
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
- Convergent conic linear programming relaxations for cone convex polynomial programs
- An algorithm for semi-infinite polynomial optimization
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Distinguished representations of non-negative polynomials
- Semidefinite relaxations for semi-infinite polynomial programming
- Lectures on Modern Convex Optimization
- Robust Convex Optimization
- Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
- A Complete Characterization of the Gap between Convexity and SOS-Convexity
- Post-Optimal Analysis in Linear Semi-Infinite Optimization
- Theory and Applications of Robust Optimization
- Semi-Infinite Programming: Theory, Methods, and Applications
- Duality in Vector Optimization
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- On solving a class of linear semi-infinite programming by SDP method
