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

DOI10.1007/s10107-009-0339-9zbMath1242.90159arXiv0806.4721OpenAlexW1979444572MaRDI QIDQ662299

Jia-Wang Nie

Publication date: 22 February 2012

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

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

zbMATH Keywords

semidefinite programmingconvex setspolynomialssemialgebraic setsreal algebraic geometry

Mathematics Subject Classification ID

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

Related Items (6)

A bilateral extension of the $q$-Selberg integral ⋮ Spectrahedral Shadows ⋮ Free semidefinite representation of matrix power functions ⋮ Semidefinite Representation of Convex Sets and Convex Hulls ⋮ GpoSolver: a Matlab/C++ toolbox for global polynomial optimization ⋮ Convex Hulls of Quadratically Parameterized Sets With Quadratic Constraints

Cites Work

• Semidefinite representation of convex sets
• The \(K\)-moment problem for compact semi-algebraic sets
• Semidefinite programming relaxations for semialgebraic problems
• Convex sets with semidefinite representation
• A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
• Global Optimization with Polynomials and the Problem of Moments
• Lectures on Modern Convex Optimization
• Linear matrix inequality representation of sets
• Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets
• Polynomials that are positive on an interval
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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