Interior-point methods

Journal of Computational and Applied Mathematics

Volumn 124, Issue 1-2, 2000, Pages 281-302

  Potra, Florian A ^a   Wright, Stephen J ^a  

^a ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; QUADRATIC PROGRAMMING;

CONVEX PROGRAMMING; INTERIOR POINTS; SEMI DEFINITE PROGRAMMING;

LINEAR PROGRAMMING;

EID: 0034541550     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(00)00433-7     Document Type: Article

References (32)

1. 3/ ln n]L) operations, CORE Discussion Paper 9746, Université Catholique de Louvain, Louvain-la-Neuve, Belgium, January 1999, SIAM J. Optim., in preparation.
2. K.M. Anstreicher J. Ji F.A. Potra Y. Ye Average performance of a self-dual interior-point algorithm for linear programming P. Pardalos Complexity in Numerical Optimization 1993 World Scientific Singapore 1 15
3. K.H. Borgwardt The Simplex Method: A Probabilistic Analysis 1987 Springer Berlin
4. A.S. El-Bakry R.A. Tapia Y. Zhang A study of indicators for identifying zero variables in interior-point methods SIAM Rev. 36 1 1994 45 72
5. A.V. Fiacco, G.P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Wiley, New York, 1968 (reprinted by SIAM, Philadelphia, PA, 1990).
6. R.M. Freund S. Mizuno Interior point methods: current status and future directions Optima 51 1996 1 9
7. M.X. Goemans D.P. Williamson Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming J. Assoc. Comput. Mach. 42 6 1995 1115 1145
8. D. Goldfarb, M.J. Todd, Linear programming, in: Optimization, North-Holland, Amsterdam, 1989, pp. 73–170.
9. J. Gondzio Multiple centrality corrections in a primal–dual method for linear programming Comput. Optim. Appl. 6 1996 137 156
10. J. Ji, F.A. Potra, R. Sheng, On the local convergence of asymmetric predictor–corrector method for semidefinite programming, Technical Report 98, Department of Mathematics, University of Iowa, Iowa City, IA 52242, USA, January 1997, SIAM J. Optim., in preparation.
11. N. Karmarkar A new polynomial-time algorithm for linear programming Combinatorica 4 1984 373 395
12. M. Kojima M. Shida S. Shindoh Local convergence of predictor–corrector infeasible-interior-point algorithms for SDPs and SDLCPs Math. Programming, Ser. A 80 2 1998 129 160
13. N. Megiddo, Pathways to the optimal set in linear programming, in: N. Megiddo (Eds.), Progress in Mathematical Programming: Interior-Point and Related Methods Springer, New York, 1989, pp. 131–158 (Chapter 8).
14. S. Mehrotra On the implementation of a primal–dual interior point method SIAM J. Optim. 2 1992 575 601
15. R.D.C. Monteiro Y. Zhang A unified analysis for a class of long-step primal–dual path-following interior-point algorithms for semidefinite programming Math. Programming Ser. A 81 3 1998 281 299
16. Yu.E. Nesterov A.S. Nemirovskii Interior Point Polynomial Methods in Convex Programming: Theory and Applications 1994 SIAM Philadelphia, PA
17. Yu.E. Nesterov M.J. Todd Self-scaled barriers and interior-point methods for convex programming Math. Oper. Res. 22 1997 1 42
18. Yu.E. Nesterov M.J. Todd Primal–dual interior-point methods for self-scaled cones SIAM J. Optim. 8 1998 324 362
19. ∗ -matrix LCP SIAM J. Optim. 7 2 1997 318 335
20. F.A. Potra R. Sheng Superlinear convergence of interior-point algorithms for semidefinite programming J. Optim. Theory Appl. 99 1 1998 103 119
21. J. Renegar A polynomial-time algorithm, based on Newton's method, for linear programming Math. Programming ■ 1988 59 93
22. J. Renegar, A mathematical view of interior-point methods in convex optimization, unpublished notes, June 1999.
23. C. Roos J.-Ph. Vial T. Terlaky Theory and Algorithms for Linear Optimization: An Interior Point Approach, Wiley-Interscience Series in Discrete Mathematics and Optimization 1997 Wiley New York
24. M.J. Todd, A study of search directions in primal–dual interior-point methods for semidefinite programming, Technical Report, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, February 1999.
25. L. Vandenberghe S. Boyd Semidefinite programming SIAM Rev. 38 1 1996 49 95
26. M.H. Wright, Interior methods for constrained optimization, in: Acta Numer. 1992, Cambridge University Press, Cambridge, 1992, pp. 341–407.
27. S.J. Wright Primal–Dual Interior-Point Methods 1997 SIAM Philadelphia, PA
28. S.J. Wright, Recent developments in interior-point methods, preprint ANL/MCS-P783-0999, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, September 1999.
29. Y. Ye Interior Point Algorithms: Theory and Analysis, Wiley-Interscience Series in Discrete Mathematics and Optimization 1997 Wiley New York
30. Y. Ye O. Güler R.A. Tapia Y. Zhang A quadratically convergent O ( n L) -iteration algorithm for linear programming Math. Programming Ser. A 59 1993 151 162
31. Y. Ye M.J. Todd S. Mizuno An O ( n L) -iteration homogeneous and self-dual linear programming algorithm Math. Oper. Res. 19 1994 53 67
32. Y. Zhang On the convergence of a class of infeasible-interior-point methods for the horizontal linear complementarity problem SIAM J. Optim. 4 1994 208 227