Convergent conic linear programming relaxations for cone convex polynomial programs

DOI10.1016/j.orl.2017.03.003zbMath1409.90131OpenAlexW2594358447MaRDI QIDQ1728215

Thai Doan Chuong, Vaithilingam Jeyakumar

Publication date: 22 February 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2017.03.003

zbMATH Keywords

semidefinite programmingcone-convex polynomial programconic linear programming relaxationconvergent relaxation

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Related Items (5)

Two optimal value functions in parametric conic linear programming ⋮ Conic linear programming duals for classes of quadratic semi-infinite programs with applications ⋮ Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications ⋮ Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers ⋮ A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs

Uses Software

• CVX
• YALMIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dual semidefinite programs without duality gaps for a class of convex minimax programs
• Exact conic programming relaxations for a class of convex polynomial cone programs
• First and second order analysis of nonlinear semidefinite programs
• Sums of squares on real algebraic curves
• Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
• 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
• Polynomial Matrix Inequality and Semidefinite Representation
• Linear Conic Optimization for Inverse Optimal Control
• Notes on Duality in Second Order and p -Order Cone Optimization
• Semidefinite Optimization and Convex Algebraic Geometry
• Pre- and Post-Processing Sum-of-Squares Programs in Practice
• Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback

This page was built for publication: Convergent conic linear programming relaxations for cone convex polynomial programs