arXiv (OAI Expanded)
open access
Goldfarb-Idnani Revisited:Invariants, Certificates, and the Limits of Guessing
The dual active-set method of Goldfarb and Idnani solves the strictly convex quadratic program by adding and dropping one constraint at a time, requiring no phase one. Primal--dual active set and block principal pivoting skip the walk altogether: they guess an entire active set at once and repair it
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
- Goldfarb-Idnani Revisited:Invariants, Certificates, and the Limits of Guessing#818967
- On the power of linear programming for K-means clustering#155468
- A semidefinite programming approach to cross $2$-intersecting families#612769
- A semidefinite programming approach to cross $2$-intersecting families#611292
- Adaptive Strategies for GR(1) Games#792400
Record · ID 808975
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