First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials

DOI10.1007/S10107-009-0339-9zbMATH Open1242.90159arXiv0806.4721OpenAlexW1979444572MaRDI QIDQ662299FDOQ662299

Authors: Jiawang Nie 

Publication date: 22 February 2012

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

Abstract: A set is called semidefinite representable or semidefinite programming (SDP) representable if it can be represented as the projection of a higher dimensional set which is represented by some Linear Matrix Inequality (LMI). This paper discuss the semidefinite representability conditions for convex sets of the form S_D(f) = {x in D: f(x) >= 0}. Here D={xin R^n: g_1(x) >= 0, ..., g_m(x) >= 0} is a convex domain defined by some "nice" concave polynomials g_i(x) (they satisfy certain concavity certificates), and f(x) is a polynomial or rational function. When f(x) is concave over mc{D}, we prove that S_D(f) has some explicit semidefinite representations under certain conditions called preordering concavity or q-module concavity, which are based on the Positivstellensatz certificates for the first order concavity criteria. When f(x) is a polynomial or rational function having singularities on the boundary of S_D(f), a perspective transformation is introduced to find some explicit semidefinite representations for S_D(f) under certain conditions. In the particular case n=2, if the Laurent expansion of f(x) around one singular point has only two consecutive homogeneous parts, we show that S_D(f) always admits an explicitly constructible semidefinite representation.

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

Recommendations

• Semidefinite representation of convex sets
• Sufficient and necessary conditions for semidefinite representability of convex hulls and sets
• Semidefinite Representation of Convex Sets and Convex Hulls
• Polynomial matrix inequality and semidefinite representation
• On semidefinite representations of non-closed sets

zbMATH Keywords

semidefinite programmingreal algebraic geometrypolynomialsconvex setssemialgebraic sets

Mathematics Subject Classification ID

Convex programming (90C25) Semidefinite programming (90C22) Semialgebraic sets and related spaces (14P10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Global optimization with polynomials and the problem of moments
• Title not available (Why is that?)
• The \(K\)-moment problem for compact semi-algebraic sets
• Semidefinite programming relaxations for semialgebraic problems
• A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomials that are positive on an interval
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Title not available (Why is that?)
• Linear matrix inequality representation of sets
• Sufficient and necessary conditions for semidefinite representability of convex hulls and sets
• Semidefinite representation of convex sets
• Convex sets with semidefinite representation

Cited In (14)

• Semidefinite representability
• Semidefinite Representation for Convex Hulls of Real Algebraic Curves
• A bilateral extension of the \(q\)-Selberg integral
• Gposolver: a Matlab/C++ toolbox for global polynomial optimization
• Semidefinite Representation of Convex Sets and Convex Hulls
• Exposed faces of semidefinitely representable sets
• On semidefinite representations of non-closed sets
• Free semidefinite representation of matrix power functions
• Semidefinite representation of convex sets
• Convex hulls of quadratically parameterized sets with quadratic constraints
• Semi-definite representations for sets of cubics on the two-dimensional sphere
• Convex sets with semidefinite representation
• Spectrahedral shadows
• Sufficient and necessary conditions for semidefinite representability of convex hulls and sets

This page was built for publication: First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q662299)