An algorithm finds exact primal-dual solutions for linear programs in the separation oracle model using O(n² log(n/δ)) oracle calls and polynomial arithmetic operations for rational inputs.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
An approximate IPTR framework for linearly constrained optimization uses low-rank projector updates to cut per-iteration cost while preserving feasibility and convergence guarantees, with experiments showing 2.48x speedup.
Algorithm for group distributionally robust linear regression using block Lewis weights to achieve (1+ε) optimality in Õ(min{rank(A), m}^{1/3} ε^{-2/3}) linear-system solves.
citing papers explorer
No citing papers match the current filters.