Nearly-Linear Time Positive LP Solver with Faster Convergence Rate

DOI10.1145/2746539.2746573zbMath1321.90078arXiv1411.1124OpenAlexW1968135284MaRDI QIDQ2941511

Lorenzo Orecchia, Zeyuan Allen Zhu

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.1124

zbMATH Keywords

primal-dual algorithmsfirst-order iterative methodspacking and covering linear programswidth-independent algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Approximation algorithms (68W25)

Related Items (9)

On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms ⋮ A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs ⋮ A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs ⋮ Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version ⋮ Fractional Set Cover in the Streaming Model. ⋮ Towards more practical linear programming-based techniques for algorithmic mechanism design ⋮ Unnamed Item ⋮ Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent ⋮ Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming

This page was built for publication: Nearly-Linear Time Positive LP Solver with Faster Convergence Rate