Probabilistic analysis of a differential equation for linear programming

Journal of Complexity

Volumn 19, Issue 4, 2003, Pages 474-510

  Ben Hur, Asa ^a,b   Feinberg, Joshua ^b,c   Fishman, Shmuel ^b,d   Siegelmann, Hava T ^e  

^a STANFORD UNIVERSITY   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c UNIVERSITY OF HAIFA   (Israel)

^d UNIVERSITY OF CALIFORNIA   (United States)

^e Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

Dynamical systems; Linear programming; Random Matrix Theory; Scaling; Theory of analog computation

Indexed keywords

EID: 0041656135     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0885-064X(03)00032-3     Document Type: Article

References (40)

1. E. Abrahams, P.W. Anderson, D.C. Licciardelo, T.V. Ramakrishnan, Scaling theory of localization: absence of quantum diffusion in two dimensions, Phys. Rev. Lett. 42 (1979) 673;
2. E. Abrahams, P.W. Anderson, D.S. Fisher, D.J. Thouless, New method for a scaling theory of localization, Phys. Rev. B 22 (1980) 3519;
3. P.W. Anderson, New method for scaling theory of localization II Multichannel theory of a "wire" and possible extension to higher dimensionality, Phys. Rev. B 23 (1981) 4828.
4. B.L. Altshuler, V.E. Kravtsov, I.N. Lerner, in: B.L. Altshuler, P.A. Lee, R.A. Webb (Eds.), Mesoscopic Phenomena in Solids, North-Holland, Amsterdam, 1991.
5. A. Anderson, R.C. Myers, V. Periwal, Complex random surfaces, Phys. Lett. B 254 (1991) 89;
6. A. Anderson, R.C. Myers, V. Periwal, Branched polymers from a double scaling limit of matrix models, Nucl. Phys. B 360 (1991) 463 (Section 3);
7. J. Feinberg, A. Zee, Renormalizing rectangles and other topics in random matrix theory, J. Statist. Mech. 87 (1997) 473-504;
8. G.M. Cicuta, L. Molinari, E. Montaldi, F. Riva, Large rectangular random matrices, J. Math. Phys. 28 (1987) 1716.
9. K.M. Anstreicher, J. Ji, F.A. Potra, Y. Ye, Probabilistic analysis of an infeasible interior-point algorithm for linear programming, Math. Oper. Res. 24 (1999) 176-192.
10. A. Ben-Hur, H.T. Siegelmann, S. Fishman, A theory of complexity for continuous time dynamics, J. Complexity 18 (2002) 51-86.
11. C.M. Bender, S.A. Orszag, Advanced Mathematical Methods for Scientists and Engineers, 2nd Edition, Springer-Verlag, New York, 1999 (Chapter 8).
12. L. Blum, F. Cucker, M. Shub, S. Smale, Complexity and Real Computation, Springer-Verlag, London, 1999.
13. M.S. Branicky, Analog computation with continuous ODEs, in: Proceedings of the IEEE Workshop on Physics and Computation, Dallas, TX, 1994, pp. 265-274.
14. E. Brézin, C. Itzykson, G. Parisi, J.-B. Zuber, Planar diagrams, Comm. Math. Phys. 59 (1978) 35.
15. R.W. Brockett, Dynamical systems that sort lists, diagonalize matrices and solve linear programming problems, Linear Algebra Appl. 146 (1991) 79-91.
16. L.O. Chua, G.N. Lin, Nonlinear programming without computation, IEEE Trans. Circuits Systems 31 (2) (1984) 182-188.
17. A. Cichocki, R. Unbehauen, Neural Networks for Optimization and Signal Processing, John Wiley, New York, 1993.
18. R. Durrett, Probability: Theory and Examples, 2nd Edition, Wadswarth Publishing Co., Belmont, 1996 (Chapter 2).
19. L. Faybusovich, Dynamical systems which solve optimization problems with linear constraints, IMA J. Math. Control Inform. 8 (1991) 135-149.
20. -1X of random matrices, arXiv:math.PR/0204312, 2002.
21. V.L. Girko, On the distribution of solutions of systems of linear equations with random coefficients, Theory Probab. Math. Statist. 2 (1974) 41-44.
22. B.V. Gnedenko, A.N. Kolmogorov, Limit Distributions for Sums of Independent Random Variables, Addison-Wesley, Reading, MA, 1954.
23. U. Helmke, J.B. Moore, Optimization and Dynamical Systems, Springer-Verlag, London, 1994.
24. J. Hertz, A. Krogh, R. Palmer, Introduction to the Theory of Neural Computation, Addison-Wesley, Redwood City, 1991.
25. X.B. Liang, J. Wang, A recurrent neural network for nonlinear optimization with a continuously differentiable objective function and bound constraints, IEEE Trans. Neural Networks 11 (2000) 1251-1262.
26. C. Mead, Analog VLSI and Neural Systems, Addison-Wesley, Reading, MA, 1989.
27. M.L. Mehta, Random Matrices, 2nd Edition, Academic Press, Boston, 1991.
28. S. Mizuno, M.J. Todd, Y. Ye, On adaptive-step primal-dual interior-point algorithms for linear programming, Math. Oper. Res. 18 (1993) 964-981.
29. C. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1995.
30. J. Renegar, Incorporating condition measures into the complexity theory of linear programming, SIAM J. Optim. 5 (3) (1995) 506-524.
31. R. Saigal, Linear Programming, Kluwer Academic, Dordrecht, 1995.
32. R. Shamir, The efficiency of the simplex method: a survey, Manage. Sci. 33 (3) (1987) 301-334.
33. H.T. Siegelmann, S. Fishman, Computation by dynamical systems, Physica D 120 (1998) 214-235.
34. S. Smale, On the average number of steps in the simplex method of linear programming, Math. Programming 27 (1983) 241-262.
35. M.J. Todd, Probabilistic models for linear programming, Math. Oper. Res. 16 (1991) 671-693.
36. J.F. Traub, H. Wozniakowski, Complexity of linear programming, Oper. Res. Lett. 1 (1982) 59-62.
37. K.G. Wilson, J. Kogut, The renormalization group and the epsilon expansion, Phys. Rep. 12 (1974) 75;
38. J. Cardy, Scaling and Renormalization in Statistical Physics, Cambridge University Press, Cambridge, 1996.
39. Y. Ye, Interior Point Algorithms: Theory and Analysis, John Wiley and Sons Inc., New York, 1997.
40. Y. Ye, Toward probabilistic analysis of interior-point algorithms for linear programming, Math. Oper. Res. 19 (1994) 38-52.