Exact conic programming relaxations for a class of convex polynomial cone programs

DOI10.1007/s10957-016-1023-xzbMath1388.90093OpenAlexW2536872194WikidataQ59241424 ScholiaQ59241424MaRDI QIDQ511965

Vaithilingam Jeyakumar, Guoyin Li

Publication date: 23 February 2017

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-016-1023-x

zbMATH Keywords

semidefinite programmingconic programmingconvex cone programsconvex polynomial optimization

Mathematics Subject Classification ID

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

Related Items (2)

Convergent conic linear programming relaxations for cone convex polynomial programs ⋮ A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
• On polynomial optimization over non-compact semi-algebraic sets
• A convex polynomial that is not sos-convex
• Semidefinite representation of convex sets
• An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
• Representation of nonnegative convex polynomials
• First and second order analysis of nonlinear semidefinite programs
• Semidefinite programming relaxations for semialgebraic problems
• A Frank--Wolfe type theorem for convex polynomial programs
• 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
• Nonsmooth vector functions and continuous optimization
• Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems
• A Complete Characterization of the Gap between Convexity and SOS-Convexity
• Polynomial Matrix Inequality and Semidefinite Representation
• On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
• Convexity in SemiAlgebraic Geometry and Polynomial Optimization
• Notes on Duality in Second Order and p -Order Cone Optimization
• Semidefinite Optimization and Convex Algebraic Geometry
• A new class of alternative theorems for SOS-convex inequalities and robust optimization
• Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback

This page was built for publication: Exact conic programming relaxations for a class of convex polynomial cone programs