An easy way to teach interior-point methods

European Journal of Operational Research

Volumn 130, Issue 1, 2001, Pages 1-19

  Terlaky, Tamás ^a  

^a MCMASTER UNIVERSITY   (Canada)

Author keywords

Interior point methods; Linear optimization; Polynomial complexity; Self dual embedding; Strictly complementary solution; Strongly polynomial rounding procedure

Indexed keywords

EID: 0008848110     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(00)00094-1     Document Type: Article

References (38)

1. F. Alizadeh, Combinatorial optimization with interior point methods and semi-definite matrices. PhD thesis, University of Minnesota, Minneapolis, USA, 1991.
2. E.D. Andersen, J. Gondzio, Cs. Mészâros, X Xu, Implementation of interior point methods for large scale linear programming, in: T. Terlaky (Ed.), Interior Point Methods of Mathematical Programming, Kluwer Academic Publishers, Dordrecht, Netherlands, 1996, pp. 189-252.
3. A.J. Goldman and A.W. Tucker, Theory of linear programming, in: H.W. Kuhn, A.W. Tucker (Eds.), Linear Inequalities and Related Systems, Annals of Mathematical Studies, vol. 38, Princeton University Press, Princeton, NJ, 1956, pp. 53-97.
4. E. de Klerk, Interior point methods for semidefinite programming. PhD thesis, Faculty of Technical Mathematics and Computer Science, Delft University of Technology, Delft, Netherlands, 1997.
5. E. de Klerk, C. Roos, and T. Terlaky, Infeasible-start semidefinite programming algorithms via self-dual embeddings, in: P.M. Pardalos, H. Wolkowicz (Eds.), Topics in Semidefinite and Interior-Point Methods, Fields Institute Communications Series, American Mathematical Society, 1998, pp. 215-236.
6. E. de Klerk, C. Roos, T. Terlaky, Initialization in semidefinite programming via a self-dual skew-symmetric embedding, Operations Research Letters 20 (1997) 213-221.
7. E. de Klerk, C. Roos, T. Terlaky, On primal-dual path-following algorithms for semidefinite programming, in: F. Gianessi, S. Komlósi, T. Rapcsák (Eds.), New Trends in Mathematical Programming, Kluwer Academic Publishers, Dordrecht, Netherlands, 1998, pp. 137-157.
8. E. de Klerk, C. Roos, T. Terlaky, Semi-definite problems in truss topology optimization, Technical Report 95-128, Faculty of Technical Mathematics and Computer Science, Delft University of Technology, Delft, Netherlands, 1995.
9. A.V. Fiacco, G.P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Wiley, New York, 1968. Reprint: SIAM Classics in Applied Mathematics, vol. 4, SIAM Publications, Philadelphia, PA, pp. 19104-2688, 1990.
10. A.V. Fiacco, G.P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Wiley, New York, 1968. Reprint: SIAM Classics in Applied Mathematics, vol. 4, SIAM Publications, Philadelphia, PA, pp. 19104-2688, 1990.
11. R. Frisch, The logarithmic potential method for solving linear programming problems, Memorandum, University Institute of Economics, Oslo, 1955.
12. D. den Hertog, Interior Point Approach to Linear, Quadratic and Convex Programming, Mathematics and its Applications, vol. 277, Kluwer Academic Publishers, Dordrecht, Netherlands, 1994.
13. B. Jansen, Interior Point Techniques in Optimization Complexity, Sensitivity and Algorithms, Applied Optimization, vol. 6, Kluwer Academic Publishers, Dordrecht, Netherlands, 1994.
14. B. Jansen, C. Roos, T. Terlaky, The theory of linear programming: Skew symmetric self-dual problems and the central path, Optimization 29 (1994) 225-233.
15. B. Jansen, J.J. de Jong, C. Roos, T. Terlaky, Sensitivity analysis in linear programming: just be careful!, European Journal of Operational Research 101 (1) (1997) 15-28.
16. N.K. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984) 373-395.
17. K.A. McShane, C.L. Monma, D.F. Shanno, Animplementation of a primal-dual interior point method for linear programming, ORSA Journal on Computing 1 (1989) 70-83.
18. N. Megiddo. Pathways to the optimal set inlinear programming, in: N. Megiddo (Ed.), Progress in Mathematical Programming: Interior Point and Related Methods, Springer, New York, 1989, pp. 131-158. Identical version in: Proceedings of the Sixth Mathematical Programming Symposium of Japan, Nagoya, Japan, 1986, pp. 1-35.
19. N. Megiddo. Pathways to the optimal set inlinear programming, in: N. Megiddo (Ed.), Progress in Mathematical Programming: Interior Point and Related Methods, Springer, New York, 1989, pp. 131-158. Identical version in: Proceedings of the Sixth Mathematical Programming Symposium of Japan, Nagoya, Japan, 1986, pp. 1-35.
20. S. Mehrotra, On the implementation of a (primal-dual) interior point method, SIAM Journal on Optimization 2 (4) (1992) 575-601.
21. S. Mehrotra, Y. Ye, On finding the optimal facet of linear programs, Mathematical Programming 62 (1993) 497-515.
22. R.D.C. Monteiro, S. Mehrotra, A general parametric analysis approach and its implications to sensitivity analysis in interior point methods, Mathematical Programming 72 (1996) 65-82.
23. Y.E. Nesterov, A.S. Nemirovski, Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms, SIAM Publications, SIAM, Philadelphia, PA, 1993.
24. Y.E. Nesterov, M.J. Todd, Self-scaled barriers and interior-point methods for convex programming, Mathematics of Operations Research 22 (1) (1997) 1-42.
25. J. Peng, C. Roos, T. Terlaky, New complexity analysis of the primal-dual Newton method for linear optimization, Technical Report 98-05, Faculty of Technical Mathematics and Computer Science, Delft University of Technology, Delft, Netherlands, 1998, Annals of Operations Research (to appear).
26. F.A. Potra, R. Sheng, Homogeneous interior point algorithms for semidefinite programming, Reports on Computational Mathematics 82, Department of Mathematics, The University of Iowa, Iowa City, IA, 1995.
27. C. Roos, T. Terlaky, J.-Ph.Vial, Theory and Algorithms for Linear Optimization, An Interior Approach, Wiley, Chichester, UK, 1997.
28. G. Sonnevend, An analytic center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, in: A. Prékopa, J. Szelezsán, B. Strazicky, (Eds.), System Modeling and Optimization: Proceedings of the 12th IFIP-Conference, Budapest, Hungary, September 1985, Lecture Notes in Control and Information Sciences, vol. 84, Springer, Berlin, 1986, pp. 866-876.
29. G. Sonnevend, An analytic center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, in: A. Prékopa, J. Szelezsán, B. Strazicky, (Eds.), System Modeling and Optimization: Proceedings of the 12th IFIP-Conference, Budapest, Hungary, September 1985, Lecture Notes in Control and Information Sciences, vol. 84, Springer, Berlin, 1986, pp. 866-876.
30. J.F. Sturm, Primal-dual interior point approach to semi-definite programming, PhD thesis, Tinbergen Institute Research Series, Erasmus University, Rotterdam, Netherlands, 1997.
31. T. Terlaky (Ed.), Interior Point Methods of Mathematical Programming, Applied Optimization, vol. 5, Kluwer Academic Publishers, Dordrecht, Netherlands, 1996.
32. A.W. Tucker. Dual systems of homogeneous linear relations, in: H.W. Kuhn, A.W. Tucker (Eds.), Linear Inequalities and Related Systems, Annals of Mathematical Studies, vol. 38, Princeton University Press, Princeton, NJ, 1956, pp. 3-18.
33. L. Vandenberghe, S. Boyd, Semidefinite programming, SIAM Review 38 (1996) 49-95.
34. S.J. Wright, Primal-Dual Interior-Point Methods, SIAM, Philadelphia, PA, 1997.
35. X. Xu, P.-F. Hung, Y. Ye, A simplified homogeneous and self-dual linear programming algorithm and its implementation, Technical Report, Department of Management Studies, The University of Iowa, Iowa City, IA, 1993.
36. Y. Ye, On the finite convergence of interior-point algorithms for linear programming, Mathematical Programming 57 (1992) 325-335.
37. Y. Ye, Interior Point Algorithms, Theory and Analysis, Wiley, Chichester, UK, 1997.
38. Y. Ye, M.J. Todd, S. Mizuno, An O(√nL)-iteration homogeneous and self-dual linear programming algorithm, Mathematics of Operations Research 19 (1994) 53-67.