arXiv (All)
open access
Failure Modes of Interior-Point SDP Solvers on Moment--SOS Hierarchies
Standard semidefinite programming (SDP) solvers working in double precision can become unreliable on difficult problems, even when their output appears plausible. We study this issue for SDP problems arising from high-order moment-SOS hierarchies. Three polynomial optimization problems are analysed
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
- An infeasible interior-point algorithm for solving primal and dual geometric programs#429971
- Long-step strategies in interior-point primal-dual methods#429967
- SDSL-Solver: Scalable Distributed Sparse Linear Solvers for Large-Scale Interior Point Methods#138899
- On the worst case complexity of potential reduction algorithms for linear programming#429995
- Validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem#174017
Record · ID 1342137
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