Semidefinite representation of convex sets

DOI10.1007/s10107-008-0240-yzbMath1192.90143arXiv0705.4068OpenAlexW1974962384MaRDI QIDQ847843

Publication date: 19 February 2010

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0705.4068

zbMATH Keywords

poscurv-convex sets positive definite Lagrange Hessian condition sos-concave functions sos-convex sets strictly quasi-concave functions

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (94)

On duality gap with polynomial multipliers for polynomial optimization problems ⋮ Learning Dynamical Systems with Side Information ⋮ 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 ⋮ The tracial Hahn-Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra ⋮ Tropically convex constraint satisfaction ⋮ Semidefinite representation of convex sets ⋮ Second-order cone programming relaxations for a class of multiobjective convex polynomial problems ⋮ Convex sets with semidefinite representation ⋮ SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization ⋮ Three-dimensional polyhedra can be described by three polynomial inequalities ⋮ Algebraic boundaries of \(\mathrm{SO}(2)\)-orbitopes ⋮ Real algebraic geometry with a view toward systems control and free positivity. Abstracts from the workshop held April 6--12, 2014. ⋮ Kurdyka-Łojasiewicz exponent via inf-projection ⋮ A bounded degree SOS hierarchy for polynomial optimization ⋮ Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness ⋮ On the Exactness of Lasserre Relaxations for Compact Convex Basic Closed Semialgebraic Sets ⋮ Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint ⋮ Sum-of-squares methods for controlled invariant sets with applications to model-predictive control ⋮ Linear optimization over homogeneous matrix cones ⋮ Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems ⋮ Exact SDP relaxations for classes of nonlinear semidefinite programming problems ⋮ Sum-of-squares relaxations in robust DC optimization and feature selection ⋮ A new technique to derive tight convex underestimators (sometimes envelopes) ⋮ NP-hardness of deciding convexity of quartic polynomials and related problems ⋮ Characterizing a class of robust vector polynomial optimization via sum of squares conditions ⋮ An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials ⋮ Spectrahedral Shadows ⋮ 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 ⋮ Maximum semidefinite and linear extension complexity of families of polytopes ⋮ Convex generalized Nash equilibrium problems and polynomial optimization ⋮ On New Classes of Nonnegative Symmetric Tensors ⋮ Convex hulls of curves of genus one ⋮ Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs ⋮ Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations ⋮ Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Polynomial Norms ⋮ Dual semidefinite programs without duality gaps for a class of convex minimax programs ⋮ Constraint Satisfaction Problems over Numeric Domains ⋮ Free semidefinite representation of matrix power functions ⋮ On Sum of Squares Representation of Convex Forms and Generalized Cauchy--Schwarz Inequalities ⋮ First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials ⋮ On solving a class of fractional semi-infinite polynomial programming problems ⋮ A new proof for the existence of degree bounds for Putinar’s Positivstellensatz ⋮ Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications ⋮ Semidefinite Optimization Estimating Bounds on Linear Functionals Defined on Solutions of Linear ODEs ⋮ 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 ⋮ Determinantal representations and Bézoutians ⋮ 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 ⋮ The tropical analogue of the Helton-Nie conjecture is true ⋮ On cones of nonnegative quartic forms ⋮ Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers ⋮ Robust SOS-convex polynomial optimization problems: exact SDP relaxations ⋮ On semidefinite representations of non-closed sets ⋮ On the exactness of Lasserre relaxations and pure states over real closed fields ⋮ An introduction to matrix convex sets and free spectrahedra ⋮ Characterizing robust solution sets of convex programs under data uncertainty ⋮ 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 ⋮ The Geometry of Discotopes ⋮ Linear operators and positive semidefiniteness of symmetric tensor spaces ⋮ Unnamed Item ⋮ A convex polynomial that is not sos-convex ⋮ Matrix convex hulls of free semialgebraic sets ⋮ 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 ⋮ Semidefinite relaxations for partitioning, assignment and ordering problems ⋮ Semidefinite Representation of Convex Sets and Convex Hulls ⋮ Multi-objective convex polynomial optimization and semidefinite programming relaxations ⋮ A Matrix Positivstellensatz with Lifting Polynomials ⋮ Semidefinite relaxations for partitioning, assignment and ordering problems ⋮ Stochastic polynomial optimization ⋮ Smooth hyperbolicity cones are spectrahedral shadows ⋮ Linear optimization with cones of moments and nonnegative polynomials ⋮ On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems ⋮ A PTAS for a class of binary non-linear programs with low-rank functions ⋮ Characterizations of mixed binary convex quadratic representable sets ⋮ The Computational Complexity of Duality ⋮ Complexity aspects of local minima and related notions ⋮ Convex Hulls of Quadratically Parameterized Sets With Quadratic Constraints ⋮ LMI Representations of Convex Semialgebraic Sets and Determinantal Representations of Algebraic Hypersurfaces: Past, Present, and Future ⋮ Semidefinite Representations of Noncompact Convex Sets ⋮ A Semidefinite Hierarchy for Containment of Spectrahedra ⋮ Coordinate Shadows of Semidefinite and Euclidean Distance Matrices ⋮ Generic Spectrahedral Shadows ⋮ Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty ⋮ Distributionally robust optimization with moment ambiguity sets ⋮ On \(p\)-norm linear discrimination

Uses Software

Cites Work

This page was built for publication: Semidefinite representation of convex sets