arXiv (All)
open access
On the Exponential Circuit Imbalance of the Ben-Tal Nemirovski Approximation
Dadush et al.\ (2024) recently developed a scaling-invariant layered least squares algorithm for linear programming whose complexity depends on the optimal condition measure $\barχ_A^*$. Their work builds on Vavasis and Ye's (1996) algorithm whose running time depends only on the constraint matrix $
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
- Gate-Efficient Implementation of the Query-Optimal Time-Dependent Hamiltonian Simulation#818688
- Gate-Efficient Implementation of the Query-Optimal Time-Dependent Hamiltonian Simulation#808696
- A Scalar Optimization Proof of Sendov's Conjecture with Reduced Computer Assistance#927547
- Unbounded Dynamic Concave Utilities via BSDEs#1037669
- Resource allocation in sparse graphs#306912
Record · ID 792805
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