Lifts of non-compact convex sets and cone factorizations

DOI10.1007/s11424-020-9050-yzbMath1470.52002arXiv1501.00115OpenAlexW3047013300WikidataQ114222443 ScholiaQ114222443MaRDI QIDQ2220437

Chu Wang, Lihong Zhi

Publication date: 22 January 2021

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

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

zbMATH Keywords

liftpolyhedronconvex setrecession conenonnegative rankpositive semidefinite rankcone factorization

Mathematics Subject Classification ID

Convex sets without dimension restrictions (aspects of convex geometry) (52A05)

Related Items (1)

Self-Dual Polyhedral Cones and Their Slack Matrices

Cites Work

• Unnamed Item
• Polytopes of minimum positive semidefinite rank
• Positive semidefinite rank
• Regularizing the abstract convex program
• Expressing combinatorial optimization problems by linear programs
• On the geometric interpretation of the nonnegative rank
• On the connection of facially exposed and nice cones
• An upper bound for nonnegative rank
• Which nonnegative matrices are slack matrices?
• Lifts of Convex Sets and Cone Factorizations
• Linear vs. semidefinite extended formulations

This page was built for publication: Lifts of non-compact convex sets and cone factorizations