On representing the positive semidefinite cone using the second-order cone

DOI10.1007/s10107-018-1233-0zbMath1412.90103arXiv1610.04901OpenAlexW2536897863MaRDI QIDQ2414901

Hamza Fawzi

Publication date: 17 May 2019

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

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

Mathematics Subject Classification ID

Semidefinite programming (90C22) Computational aspects related to convexity (52B55) Quadratic programming (90C20)

Related Items (6)

Lifting for Simplicity: Concise Descriptions of Convex Sets ⋮ SONC optimization and exact nonnegativity certificates via second-order cone programming ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization ⋮ Limitations on the Expressive Power of Convex Cones without Long Chains of Faces ⋮ Second-Order Cone Representation for Convex Sets in the Plane

Cites Work

• Unnamed Item
• Worst-case results for positive semidefinite rank
• Positive definite completions of partial Hermitian matrices
• Positive semidefinite matrices with a given sparsity pattern
• Lectures on Modern Convex Optimization
• Turan's Graph Theorem
• Semidefinite Optimization and Convex Algebraic Geometry
• Lifts of Convex Sets and Cone Factorizations
• On the existence of convex decompositions of partially separable functions
• On Polyhedral Approximations of the Second-Order Cone

This page was built for publication: On representing the positive semidefinite cone using the second-order cone