A simple polynomial-time rescaling algorithm for solving linear programs

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 315-320

  Dunagan, John ^a   Vempala, Santosh ^b  

^a MICROSOFT RESEARCH   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Linear Programming; Perceptron; Polynomial Time

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LEARNING SYSTEMS; LINEAR PROGRAMMING; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES; SET THEORY; THEOREM PROVING; VECTORS;

ELLIPSOID METHODS; PERCEPTRON ALGORITHM; POLYNOMIAL TIME; THRESHOLD FUNCTIONS;

NEURAL NETWORKS;

EID: 4544291740     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007404     Document Type: Conference Paper

References (24)

1. S. Agmon, The relaxation method for linear inequalities, Canadian J. of Math., 6(3), 382-392, 1954.
2. D. Bertsimas and S. Vempala, Solving convex programs by random walks, Proceedings of the Annual A CM Symposium on the Theory of Computing, 109-115, 2002.
3. A. Blum and J. Dunagan, Smoothed Analysis of the Perceptron Algorithm for Linear Programming, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 905-914, 2002.
4. A. Blum, A. Frieze, R. Kannan, and S. Vempala, A polynomial-time algorithm for learning noisy linear threshold functions, Algorithmica, 22(1), 35-52, 1998.
5. T. Bylander, Learning linear threshold functions in the presence of classification noise, Proceedings of the Workshop on Computational Learning Theory, 1994.
6. E. Cohen, Learning noisy perceptrons by a perceptron in polynomial time, Proceedings of the Annual IEEE Symposium on the Foundations of Computer Science, 514-523, 1997.
7. F. Cucker and D. Cheung, A new condition number for linear programming, Mathematical Programming, Series A, 91(1), 163-174, 2001.
8. V. Chvatal, Linear Programming, W.H. Freeman, 1983.
9. J. Dunagan, S. Teng, and D. A. Spielman, Smoothed Analysis of Renegar's Condition Number for Linear Programming, SIAM Conference on Optimization, 2002.
10. R. M. Freund and S. Mizuno: "Interior Point Methods: Current Status and Future Directions." in High Performance Optimization, H. Frenk et al. (eds.), Kluwer Academic Publishers, pp. 441-466, 2000.
11. R. M. Freund and J. R. Vera, Some characterizations and properties of the "distance to ill-posedness" and the condition measure of a conic linear system, Math. Programming, 86, 225-260, 1999.
12. J. Forster, A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity, Sixteenth Annual IEEE Conference on Computational Complexity 2001, http://citeseer.nj.nec.com/forster01linear.html
13. L. Grotchel, L. Lovasz, and A. Schrijver, Geometric algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
14. N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, 4, 373-396, 1984.
15. L. G. Khachiyan, A polynomial algorithm in linear programming, (in Russian), Doklady Akedamii Nauk SSSR, 244, 1093-1096, 1979 (English translation: Soviet Mathematics Doklady, 20, 191-194, 1979).
16. L. G. Khachiyan, A polynomial algorithm in linear programming, (in Russian), Doklady Akedamii Nauk SSSR, 244, 1093-1096, 1979 (English translation: Soviet Mathematics Doklady, 20, 191-194, 1979).
17. M. L. Minsky and S. A. Papert, Perceptrons: An introduction to computational geometry. 1969.
18. J. Renegar, Incorporating condition measures into the complexity theory of linear programming, SIAM Journal on Optimization, 5(3), 506-524, 1995.
19. F. Rosenblatt, Principles of Neurodynamics, Spartan Books, 1962.
20. R. Servedio. On PAC Learning using Perceptron, Winnow and a Perceptron-Like Algorithm. SIAM Journal on Computing, 31(5), 1358-1369, 2002.
21. R. Servedio, Smooth Boosting and Learning with Malicious Noise. Fourteenth Annual Conference on Computational Learning Theory, 473-489, 2001.
22. P. M. Vaidya, A new algorithm for minimizing convex functions over convex sets, Mathematical Programming, 291-341, 1996.
23. D. B. Yudin and A. S. Nemirovski, Evaluation of the information complexity of mathematical programming problems, (in Russian), Ekonomika i Matematicheskie Metody 12, 128-142, 1976 (English translation: Matekon 13, 2, 3-45, 1976).
24. D. B. Yudin and A. S. Nemirovski, Evaluation of the information complexity of mathematical programming problems, (in Russian), Ekonomika i Matematicheskie Metody 12, 128-142, 1976 (English translation: Matekon 13, 2, 3-45, 1976).