Terracini convexity

DOI10.1007/s10107-022-01774-yOpenAlexW3089409253MaRDI QIDQ2687050

Venkat Chandrasekaran, James Saunderson

Publication date: 1 March 2023

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

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

zbMATH Keywords

semidefinite programmingface latticehyperbolic programmingneighborly polytopesmoments and nonnegative polynomials

Mathematics Subject Classification ID

Semidefinite programming (90C22) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Random convex sets and integral geometry (aspects of convex geometry) (52A22)

Cites Work

• Unnamed Item
• Unnamed Item
• Non-representable hyperbolic matroids
• Neighborly embedded manifolds
• The convex geometry of linear inverse problems
• Hyperbolic programs, and their derivative relaxations
• Lacunas for hyperbolic differential operators with constant coefficients.I
• A Mathematical View of Interior-Point Methods in Convex Optimization
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Convex Polytopes
• Living on the edge: phase transitions in convex programs with random data
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
• Do Sums of Squares Dream of Free Resolutions?
• Sparse nonnegative solution of underdetermined linear equations by linear programming
• Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization

This page was built for publication: Terracini convexity