Dipòsit Digital de Documents de la UAB
metadata only
An infeasible interior-point algorithm for solving primal and dual geometric programs
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
- Introduction to Mathematical Programming#3612
- Presolve heuristics in HiGHS: implementation and computational study#1037621
- MoMPy: automated construction of moment matrices for semidefinite programming relaxations#625097
- MoMPy: automated construction of moment matrices for semidefinite programming relaxations#622824
- Distributed Santa Claus via Global Rounding#1084194
Record · ID 429971
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