Pat/h finding methods for linear programming: Solving linear programs in õ(rank) iterations and faster algorithms for maximum flow

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2014, Pages 424-433

  Lee, Yin Tat ^a   Sidford, Aaron ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Interior point; linear program; maximum flow

Indexed keywords

FLOW GRAPHS; ITERATIVE METHODS; LINEAR SYSTEMS; POLYNOMIAL APPROXIMATION;

ALGORITHM FOR SOLVING; INTERIOR POINT; ITERATION BOUND; LINEAR PROGRAMS; MAXIMUM FLOW PROBLEMS; MAXIMUM FLOWS; POLYNOMIAL-TIME; TIME ALGORITHMS;

LINEAR PROGRAMMING;

EID: 84920044028     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2014.52     Document Type: Conference Paper

References (47)

1. Kurt M Anstreicher. Potential reduction algorithms. In Interior point methods of mathematical programming, pages 125-158. Springer, 1996.
2. Kurt M. Anstreicher. Volumetric path following algorithms for linear programming. Math. Program., 76:245-263, 1996.
3. Andr A Bencz and David R Karger. Approximating st minimum cuts in (n 2) time. In Proceedings of the twentyeighth annual ACM symposium on Theory of computing, pages 47-55. ACM, 1996.
4. Paul Christiano, Jonathan A Kelner, Aleksander Madry, Daniel A Spielman, and Shang-Hua Teng. Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs. In Proceedings of the 43rd annual ACM symposium on Theory of computing, pages 273-282. ACM, 2011.
5. Samuel I Daitch and Daniel A Spielman. Faster approximate lossy generalized flow via interior point algorithms. In Proceedings of the 40th annual ACM symposium on Theory of computing, pages 451-460. ACM, 2008.
6. Jack Edmonds and Richard M Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM (JACM), 19(2):248-264, 1972.
7. Shimon Even and R Endre Tarjan. Network flow and testing graph connectivity. SIAM journal on computing, 4(4):507-518, 1975.
8. Robert M Freund. Projective transformations for interior point methods, part ii: Analysis of an algorithm for finding the weighted center of a polyhedral system. 1988.
9. Robert M Freund and Michael J Todd. Barrier functions and interior-point algorithms for linear programming with zero-, one-, or two-sided bounds on the variables. Mathematics of Operations Research, 20(2):415-440, 1995.
10. Zvi Galil and va Tardos. An o (n 2 (m+ n log n) log n) mincost flow algorithm. Journal of the ACM (JACM), 35(2):374-386, 1988.
11. Andrew V. Goldberg and Satish Rao. Beyond the flow decomposition barrier. J. ACM, 45(5):783-797, 1998.
12. Andrew V Goldberg and Robert E Tarjan. Finding minimumcost circulations by successive approximation. Mathematics of Operations Research, 15(3):430-466, 1990.
13. Clovis C Gonzaga. Path-following methods for linear programming. SIAM review, 34(2):167-224, 1992.
14. David Karger and Matthew Levine. Random sampling in residual graphs. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pages 63-66. ACM, 2002.
15. David R Karger. Better random sampling algorithms for flows in undirected graphs. In Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, pages 490-499. Society for Industrial and Applied Mathematics, 1998.
16. Narendra Karmarkar. A new polynomial-time algorithm for linear programming. In Proceedings of the sixteenth annual ACM symposium on Theory of computing, pages 302-311. ACM, 1984.
17. Jonathan A Kelner, Lorenzo Orecchia, Yin Tat Lee, and Aaron Sidford. An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations. arXiv preprint arXiv:1304.2338, 2013.
18. Leonid G Khachiyan. Rounding of polytopes in the real number model of computation. Mathematics of Operations Research, 21(2):307-320, 1996.
19. Yin Tat Lee, Satish Rao, and Nikhil Srivastava. A new approach to computing maximum flows using electrical flows. In The 45th ACM Symposium on Theory of Computing (STOC), pages 755-764, 2013.
20. Yin Tat Lee and Aaron Sidford. Path-finding i: Solving linear programs with (sqrt (rank)) linear system solves. arXiv preprint arXiv:1312.6676, 2013.
21. Yin Tat Lee and Aaron Sidford. Path-finding ii : An (m sqrt (n)) algorithm for the minimum cost flow problem. arXiv preprint arXiv:1312.6713, 2013.
22. Mu Li, Gary L Miller, and Richard Peng. Iterative row sampling. 2012.
23. L zl Lov z and Santosh Vempala. Simulated annealing in convex bodies and an o∗(n4) volume algorithm. J. Comput. Syst. Sci., 72(2):392-417, 2006.
24. Aleksander Madry. Fast approximation algorithms for cutbased problems in undirected graphs. In FOCS, pages 245-254, 2010.
25. Aleksander Madry. Navigating central path with electrical flows: from flows to matchings, and back. In Proceedings of the 54th Annual Symposium on Foundations of Computer Science, 2013.
26. Michael W. Mahoney. Randomized algorithms for matrices and data. Foundations and Trends in Machine Learning, 3(2):123-224, 2011.
27. Jelani Nelson and Huy L Nguy . Osnap: Faster numerical linear algebra algorithms via sparser subspace embeddings. arXiv preprint arXiv:1211.1002, 2012.
28. Yu. Nesterov. Rounding of convex sets and efficient gradient methods for linear programming problems. Optimization Methods Software, 23(1):109-128, February 2008.
29. Yu E Nesterov and Michael J Todd. Self-scaled barriers and interior-point methods for convex programming. Mathematics of Operations research, 22(1):1-42, 1997.
30. Yurii Nesterov and Arkadii Semenovich Nemirovskii. Interior-point polynomial algorithms in convex programming, volume 13. Society for Industrial and Applied Mathematics, 1994.
31. James B Orlin. Genuinely polynominal simplex and nonsimplex algorithms for the minimum cost flow problem. 1984.
32. James B Orlin. A faster strongly polynomial minimum cost flow algorithm. Operations research, 41(2):338-350, 1993.
33. James B Orlin. Max flows in o (nm) time, or better. In Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, pages 765-774. ACM, 2013.
34. Richard Peng and Daniel A Spielman. An efficient parallel solver for sdd linear systems. arXiv preprint arXiv:1311.3286, 2013.
35. James Renegar. A polynomial-time algorithm, based on newton's method, for linear programming. Mathematical Programming, 40(1-3):59-93, 1988.
36. Jonah Sherman. Nearly maximum flows in nearly linear time. In Proceedings of the 54th Annual Symposium on Foundations of Computer Science, 2013.
37. Daniel A. Spielman and Nikhil Srivastava. Graph sparsification by effective resistances. In STOC, pages 563-568, 2008.
38. Daniel A Spielman and Shang-Hua Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 81-90. ACM, 2004.
39. SP Tarasov, LG Khachiyan, and I Erlikh. The method of inscribed ellipsoids. In Soviet Mathematics Doklady, volume 37, pages 226-230, 1988.
40. va Tardos. A strongly polynomial minimum cost circulation algorithm. Combinatorica, 5(3):247-255, 1985.
41. Pravin M. Vaidya. An algorithm for linear programming which requires o(((m + n)n2 + (m + n)1.5n)l) arithmetic operations. In STOC, pages 29-38, 1987.
42. Pravin M. Vaidya. A new algorithm for minimizing convex functions over convex sets (extended abstract). In FOCS, pages 338-343, 1989.
43. Pravin M Vaidya. Speeding-up linear programming using fast matrix multiplication. In Foundations of Computer Science, 1989., 30th Annual Symposium on, pages 332-337. IEEE, 1989.
44. Pravin M. Vaidya. Reducing the parallel complexity of certain linear programming problems (extended abstract). In FOCS, pages 583-589, 1990.
45. Pravin M Vaidya. A new algorithm for minimizing convex functions over convex sets. Mathematical Programming, 73(3):291-341, 1996.
46. Pravin M Vaidya and David S Atkinson. A technique for bounding the number of iterations in path following algorithms. Complexity in Numerical Optimization, pages 462-489, 1993.
47. Virginia Vassilevska Williams. Multiplying matrices faster than coppersmith-winograd. In STOC, pages 887-898, 2012.