A Complete Characterization of the Gap between Convexity and SOS-Convexity
From MaRDI portal
Publication:2848175
DOI10.1137/110856010zbMath1295.52009arXiv1111.4587OpenAlexW3103158853MaRDI QIDQ2848175
Pablo A. Parrilo, Amir Ali Ahmadi
Publication date: 25 September 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.4587
Semidefinite programming (90C22) Convex functions and convex programs in convex geometry (52A41) Computational aspects in algebraic geometry (14Q99)
Related Items (36)
On duality gap with polynomial multipliers for polynomial optimization problems ⋮ Further results on sum-of-squares tensors ⋮ Convergence guarantees for a class of non-convex and non-smooth optimization problems ⋮ Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data ⋮ Lifting for Simplicity: Concise Descriptions of Convex Sets ⋮ Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems ⋮ Second-order cone programming relaxations for a class of multiobjective convex polynomial problems ⋮ On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty ⋮ SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization ⋮ New examples of extremal positive linear maps ⋮ Exact SDP relaxations for classes of nonlinear semidefinite programming problems ⋮ Sum-of-squares relaxations in robust DC optimization and feature selection ⋮ Characterizing a class of robust vector polynomial optimization via sum of squares conditions ⋮ On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems ⋮ Robust second order cone conditions and duality for multiobjective problems under uncertainty data ⋮ Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs ⋮ Polynomial Norms ⋮ Dual semidefinite programs without duality gaps for a class of convex minimax programs ⋮ On Sum of Squares Representation of Convex Forms and Generalized Cauchy--Schwarz Inequalities ⋮ On solving a class of fractional semi-infinite polynomial programming problems ⋮ Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications ⋮ A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials ⋮ Solving fractional multicriteria optimization problems with sum of squares convex polynomial data ⋮ Exact conic programming relaxations for a class of convex polynomial cone programs ⋮ DC decomposition of nonconvex polynomials with algebraic techniques ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint ⋮ On cones of nonnegative quartic forms ⋮ Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers ⋮ A new class of alternative theorems for SOS-convex inequalities and robust optimization ⋮ A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs ⋮ Unnamed Item ⋮ Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials ⋮ Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints ⋮ Multi-objective convex polynomial optimization and semidefinite programming relaxations ⋮ Time-Varying Semidefinite Programs ⋮ On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
Uses Software
This page was built for publication: A Complete Characterization of the Gap between Convexity and SOS-Convexity
