arXiv (All)
open access
The Maximum Singularity Degree for Linear and Semidefinite Programming
Facial reduction (FR) is an important tool in linear and semidefinite programming, providing both algorithmic and theoretical insights into these problems. The maximum length of an FR sequence for a convex set is referred to as the maximum singularity degree (MSD). The MSD gives a choice-robust wors
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Effective algorithms for tensor train decomposition via the UTV framework#1117213
- Minimization of hypersurfaces#1077805
- Boundary Geometry and Global Rates of Cyclic Coordinate Descent for SVM Duals#1144207
- Improved Multilayered PCPs and Hypergraph Vertex Cover#974864
- Improving Sparse-View 3DGS Generalization via Flat Minima Optimization#329141
Record · ID 1013374
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive