Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 27-39

  Végh, László A ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

convex optimization; market equilibrium; network flow algorithms; strongly polynomial algorithms

Indexed keywords

CONVEX FUNCTIONS; CONVEX OBJECTIVES; KEY CHARACTERISTICS; MARKET EQUILIBRIA; MINIMUM COST FLOWS; NETWORK FLOW ALGORITHMS; NONLINEAR EXTENSION; OPTIMAL SOLUTIONS; QUADRATIC COSTS; RUNNING TIME; STRONGLY POLYNOMIAL ALGORITHM;

ALGORITHMS; COMMERCE; COMPUTATION THEORY; CONVEX OPTIMIZATION; COST ACCOUNTING; MANGANESE COMPOUNDS; OPTIMAL SYSTEMS;

POLYNOMIALS;

EID: 84862601202     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2213981     Document Type: Conference Paper

References (37)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., Feb. 1993.
2. B. Birnbaum, N. R. Devanur, and L. Xiao. Distributed algorithms via gradient descent for Fisher markets. In Proceedings of ACM EC, pages 127-136, 2011.
3. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9(3):251-280, 1990.
4. S. Cosares and D. S. Hochbaum. Strongly polynomial algorithms for the quadratic transportation problem with a fixed number of sources. Mathematics of Operations Research, pages 94-111, 1994.
5. N. R. Devanur, C. H. Papadimitriou, A. Saberi, and V. V. Vazirani. Market equilibrium via a primal-dual algorithm for a convex program. Journal of the ACM (JACM), 55(5):22, 2008.
6. J. Edmonds and R. M. Karp. Theoretical improvements in algorithmic efficiency for network ow problems. Journal of the ACM (JACM), 19(2):248-264, 1972.
7. E. Eisenberg and D. Gale. Consensus of subjective probabilities: The pari-mutuel method. The Annals of Mathematical Statistics, 30(1):165-168, 1959.
8. R. Floyd. Algorithm 97: shortest path. Communications of the ACM, 5(6):345, 1962.
9. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM (JACM), 34(3):596-615, 1987.
10. S. Fujishige. Submodular systems and related topics. Mathematical Programming at Oberwolfach II, pages 113-131, 1984.
11. G. Goel and V. V. Vazirani. A perfect price discrimination market model with production, and a (rational) convex program for it. Mathematics of Operations Research, 36:762-782, 2011.
12. F. Granot and J. Skorin-Kapov. Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm. Mathematical Programming, 46(1):225-236, 1990. (Pubitemid 20683952)
13. D. Hochbaum and S. Hong. About strongly polynomial time algorithms for quadratic optimization over submodular constraints. Mathematical programming, 69(1):269-309, 1995.
14. D. Hochbaum and M. Queyranne. Minimizing a convex cost closure set. SIAM Journal on Discrete Mathematics, 16:192, 2003.
15. D. S. Hochbaum. Lower and upper bounds for the allocation problem and other nonlinear optimization problems. Mathematics of Operations Research, 19(2):390-409, 1994.
16. D. S. Hochbaum. Complexity and algorithms for nonlinear optimization problems. Annals of Operations Research, 153(1):257-296, 2007.
17. D. S. Hochbaum and J. G. Shanthikumar. Convex separable optimization is not much harder than linear optimization. Journal of the ACM (JACM), 37(4):843-862, 1990.
18. S. Iwata. A capacity scaling algorithm for convex cost submodular ows. Mathematical Programming, 76(2):299-308, 1997. (Pubitemid 127423990)
19. S. Iwata, S. Mccormick, and M. Shigeno. Fast cycle canceling algorithms for minimum cost submodular ow. Combinatorica, 23(3):503-525, 2003. (Pubitemid 38002516)
20. K. Jain and V. V. Vazirani. Eisenberg-Gale markets: Algorithms and game-theoretic properties. Games and Economic Behavior, 70(1):84-106, 2010.
21. A. V. Karzanov and S. T. McCormick. Polynomial methods for separable convex optimization in unimodular linear spaces with applications. SIAM J. Comput., 26(4):1245-1275, 1997.
22. N. Megiddo. Combinatorial optimization with rational objective functions. Mathematics of Operations Research, 4(4):414-424, 1979.
23. N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. Journal of the ACM (JACM), 30(4):852-865, 1983. (Pubitemid 14468704)
24. M. Minoux. A polynomial algorithm for minimum quadratic cost ow problems. European Journal of Operational Research, 18(3):377-387, 1984. (Pubitemid 15425032)
25. M. Minoux. Solving integer minimum cost flows with separable convex cost objective polynomially. Mathematical Programming Study, 25:237, 1985.
26. K. Nagano. On convex minimization over base polytopes. Integer Programming and Combinatorial Optimization, pages 252-266, 2007.
27. N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani. Algorithmic Game Theory. Cambridge University Press New York, NY, USA, 2007.
28. J. B. Orlin. A faster strongly polynomial minimum cost ow algorithm. Operations Research, 41(2):338-350, 1993.
29. J. B. Orlin. Improved algorithms for computing Fisher's market clearing prices. In Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC), pages 291-300. ACM, 2010.
30. J. Renegar. On the worst-case arithmetic complexity of approximating zeros of polynomials. Journal of Complexity, 3(2):90-113, 1987.
31. V. I. Shmyrev. An algorithm for finding equilibrium in the linear exchange model with fixed budgets. Journal of Applied and Industrial Mathematics, 3(4):505-518, 2009.
32. A. Tamir. A strongly polynomial algorithm for minimum convex separable quadratic cost ow problems on series-parallel networks. Mathematical Programming, 59:117-132, 1993. (Pubitemid 23683312)
33. É. Tardos. A strongly polynomial minimum cost circulation algorithm. Combinatorica, 5(3):247-255, 1985.
34. É. Tardos. A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research, 34(2):250-256, 1986. (Pubitemid 17461680)
35. V. V. Vazirani. Spending constraint utilities with applications to the adwords market. Mathematics of Operations Research, 35(2):458-478, 2010.
36. V. V. Vazirani. The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game. Journal of ACM (JACM), 59(2), 2012.
37. L. A. Végh. Concave generalized flows with applications to market equilibria. Arxiv preprint arXiv:1109.3893, 2011.