A first order method for linear programming parameterized by circuit imbalance
From MaRDI portal
Cites work
- A primal-dual interior point method whose running time depends only on the constraint matrix
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- A strongly polynomial minimum cost circulation algorithm
- An update-and-stabilize framework for the minimum-norm-point problem
- Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard
- Circuit Imbalance Measures and Linear Programming
- Faster first-order primal-dual methods for linear programming using restarts and sharpness
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- Linear convergence of first order methods for non-strongly convex optimization
- Mathematical problems for the next century
- Revisiting Tardos's framework for linear programming: faster exact solutions using approximate solvers
- RSG: Beating Subgradient Method without Smoothness and Strong Convexity
This page was built for publication: A first order method for linear programming parameterized by circuit imbalance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030573)
