A SEMIDEFINITE HIERARCHY FOR CONTAINMENT OF SPECTRAHEDRA KAI KELLNER, THORSTEN THEOBALD, AND CHRISTIAN TRABANDT Abstract. A spectrahedron is the positivity region of a linear matrix pencil and thus the feasible set of a

Source URL: www.math.uni-frankfurt.de

CONTAINMENT PROBLEMS FOR POLYTOPES AND SPECTRAHEDRA KAI KELLNER, THORSTEN THEOBALD, AND CHRISTIAN TRABANDT Abstract. We study the computational question whether a given polytope or spectrahedron SA (as given by the posit

Source URL: www.math.uni-frankfurt.de

Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones James Saunderson Pablo A. Parrilo

Source URL: www.mit.edu

• Operations research
• Convex analysis
• Linear algebra
• Real algebraic geometry
• Convex optimization
• Semidefinite programming
• Spectrahedron
• Linear programming
• Convex cone
• Mathematical optimization
• Mathematics
• Geometry

The Geometry of Semidefinite Programming

Source URL: www.aimath.org

• Mathematical optimization
• Convex analysis
• Real algebraic geometry
• Matrices
• Spectrahedron
• Semidefinite programming
• Linear matrix inequality
• Matrix
• N-ellipse
• Algebra
• Mathematics
• Linear algebra