A simple polynomial-time rescaling algorithm for solving linear programs

Mathematical Programming

Volumn 114, Issue 1, 2008, Pages 101-114

  Dunagan, John ^a   Vempala, Santosh ^b,c  

^a MICROSOFT RESEARCH   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LEARNING SYSTEMS; LINEAR PROGRAMMING;

ELEMENTARY DESCRIPTION; NOISE-TOLERANCE; PERCEPTRON ALGORITHM; WORST-CASE COMPLEXITY;

POLYNOMIALS;

EID: 41149110111     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-007-0095-7     Document Type: Article

References (30)

1. Agmon S. (1954). The relaxation method for linear inequalities. Can. J. Math. 6(3): 382-392
2. Bertsimas D. and Vempala S. (2004). Solving convex programs by random walks. J. ACM 51(4): 540-556
3. Blum, A., Dunagan, J.: Smoothed Analysis of the Perceptron Algorithm for Linear Programming. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 905-914 (2002)
4. Blum A., Frieze A., Kannan R. and Vempala S. (1998). A polynomial-time algorithm for learning noisy linear threshold functions. Algorithmica 22(1): 35-52
5. Bylander, T.: Learning linear threshold functions in the presence of classification noise. In: Proceedings of the Workshop on Computational Learning Theory (1994)
6. Cohen, E.: Learning noisy perceptrons by a perceptron in polynomial time. In: Proceedings of the Annual IEEE Symposium on the Foundations of Computer Science, pp. 514-523 (1997)
7. Cucker F. and Cheung D. (2001). A new condition number for linear programming. Math. Program. Ser. A 91(1): 163-174
8. Chvatal V. (1983). Linear Programming. W.H. Freeman, San Francisco
9. Dunagan, J., Teng, S., Spielman, D.A.: Smoothed analysis of Renegar's condition number for linear programming. In: SIAM Conference on Optimization (2002)
10. Freund R.M. and Mizuno S. (2000). Interior point methods: current status and future directions. In: Frenk, H. (eds) High Performance Optimization., pp 441-466. Kluwer, Dordrecht
11. Freund R.M. and Vera J.R. (1999). Some characterizations and properties of the distance to ill-posedness and the condition measure of a conic linear system. Math. Program. 86: 225-260
12. Forster, J.: A linear lower bound on the unbounded error probabilistic communication complexity. In: 16th Annual IEEE Conference on Computational Complexity (2001). http:// citeseer.nj.nec.com/forster01linear.html
13. Goffin, J.-L.: On the finite convergence of the relaxation method for solving systems of inequalities. Ph.D Thesis (1971). Also research report of the Operations Research Center, University of California at Berkeley
14. Goffin J.-L. (1980). The relaxation method for solving systems of linear inequalities. Math. Oper. Res. 5(3): 388-414
15. Grötchel L., Lovasz L. and Schrijver A. (1988). Geometric algorithms and Combinatorial Optimization. Springer, Berlin
16. Karmarkar N. (1984). A new polynomial-time algorithm for linear programming. Combinatorica 4: 373-396
17. Khachiyan, L.G.: A polynomial algorithm in linear programming, (in Russian), Doklady Akedamii Nauk SSSR, vol. 244, pp. 1093-1096 (1979)
18. (English translation: Soviet Mathematics Doklady, 20, 191-194 1979)
19. Minsky, M.L., Papert, S.A.: Perceptrons: sn introduction to computational geometry (1969)
20. Renegar J. (1995). Incorporating condition measures into the complexity theory of linear programming. SIAM J Optim 5(3): 506-524
21. Rosenblatt F. (1962). Principles of Neurodynamics. Spartan Books, New York
22. Schrijver A. (1998). Theory of Linar and Integer Programming. Wiley, New York
23. Servedio R. (2002). On PAC learning using perceptron, winnow and a perceptron-like algorithm. SIAM J. Comput. 31(5): 1358-1369
24. Servedio, R.: Smooth boosting and learning with malicious noise. In: 14th Annual Conference on Computational Learning Theory, pp. 473-489 (2001)
25. Shor N.Z. (1977). Cut-off method with space extension in convex programming problems. Cybernetics 13: 94-96
26. Shor, N.Z.: Utilization of the operation of space dilation in the minimization of convex functions. Kibernetika 1, 6-12 (1970)
27. English translation: Cybernetics, 1, 7-15
28. Vaidya P.M. (1996). A new algorithm for minimizing convex functions over convex sets. Math Program 73: 291-341
29. Yudin, D.B., Nemirovski, A.S.: Evaluation of the information complexity of mathematical programming problems (in Russian). Ekonomika i Matematicheskie Metody 12, 128-142, (1976)
30. (English translation: Matekon 13(2), 3-45 1976)