Convex Hulls of Algebraic Sets

DOI10.1007/978-1-4614-0769-0_5zbMath1334.90102arXiv1007.1191OpenAlexW1534511674MaRDI QIDQ2802521

Rekha R. Thomas, João Gouveia

Publication date: 26 April 2016

Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25)

Related Items

Lifting for Simplicity: Concise Descriptions of Convex Sets, Strong nonnegativity and sums of squares on real varieties, Algebraic boundaries of \(\mathrm{SO}(2)\)-orbitopes, Semidefinite approximations of conical hulls of measured sets, Matrix convex hulls of free semialgebraic sets, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, Linear optimization with cones of moments and nonnegative polynomials

Uses Software

• SeDuMi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
• Convex analysis and nonlinear optimization. Theory and examples.
• Semidefinite representations for finite varieties
• Compressed polytopes and statistical disclosure limitation
• Semidefinite characterization and computation of zero-dimensional real radical ideals
• Graph isomorphism and theorems of Birkhoff type
• The \(K\)-moment problem for compact semi-algebraic sets
• Geometric algorithms and combinatorial optimization.
• Semidefinite programming relaxations for semialgebraic problems
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Recognizing graph theoretic properties with polynomial ideals
• Convex sets with semidefinite representation
• Global Optimization with Polynomials and the Problem of Moments
• The moment problem for non-compact semialgebraic sets
• An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
• Theta Bodies for Polynomial Ideals
• Positive Polynomials and Projections of Spectrahedra
• Cones of Matrices and Set-Functions and 0–1 Optimization
• On the Shannon capacity of a graph
• Decompositions of Rational Convex Polytopes
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones