On semidefinite representations of non-closed sets

DOI10.1016/J.LAA.2010.02.005zbMATH Open1193.15017arXiv0907.2764OpenAlexW2964328813MaRDI QIDQ968981FDOQ968981

Tim Netzer

Publication date: 11 May 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: Spectrahedra are sets defined by linear matrix inequalities. Projections of spectrahedra are called semidefinitely representable sets. Both kinds of sets are of practical use in polynomial optimization, since they occur as feasible sets in semidefinite programming. There are several recent results on the question which sets are semidefinite representable. So far, all results focus on the case of closed sets. In this work we develop a new method to prove semidefinite representability of sets which are not closed. For example, the interior of a semidefinite representable set is shown to be semidefinite representable. More general, one can remove faces of a semidefinite representable set and preserve semidefinite representability, as long as the faces are parametrized in a suitable way.

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

Recommendations

• Exposed faces of semidefinitely representable sets
• Semidefinite representation of convex sets
• First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials
• Convex sets with semidefinite representation
• Semidefinite representability

zbMATH Keywords

polynomial optimizationsemidefinite programminglinear matrix inequalitiesspectrahedrapositive matricessemidefinite representations of sets

Mathematics Subject Classification ID

Semidefinite programming (90C22) Positive matrices and their generalizations; cones of matrices (15B48) Miscellaneous inequalities involving matrices (15A45) Semialgebraic sets and related spaces (14P10) Sums of squares and representations by other particular quadratic forms (11E25) Real algebra (13J30)

Cites Work

• Semidefinite Programming
• Title not available (Why is that?)
• Exposed Faces of Semidefinitely Representable Sets
• Linear matrix inequality representation of sets
• Conditions for Positive and Nonnegative Definiteness in Terms of Pseudoinverses
• Some geometric results in semidefinite programming
• Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets
• Semidefinite representation of convex sets
• The Lax conjecture is true
• Convex sets with semidefinite representation

Cited In (9)

• Semi-definite programming and quantum information
• Distributionally robust optimization with moment ambiguity sets
• Semidefinite Representation for Convex Hulls of Real Algebraic Curves
• Spectrahedral Shadows
• Free semidefinite representation of matrix power functions
• On the Exactness of Lasserre Relaxations for Compact Convex Basic Closed Semialgebraic Sets
• Second-Order Cone Representation for Convex Sets in the Plane
• Convex hulls of curves of genus one
• Complexity aspects of local minima and related notions

This page was built for publication: On semidefinite representations of non-closed sets

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