Perturbed path following predictor-corrector interior point algorithms

Optimization Methods and Software

Volumn 11, Issue 1, 1999, Pages 183-210

  Bonnans, J Frédéric ^a   Pola, Cecilia ^b   Rébai, Raja ^a  

^a INRIA ROCQUENCOURT   (France)

^b UNIVERSITY OF CANTABRIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; PERTURBATION TECHNIQUES;

LINEAR COMPLEMENTARITY PROBLEMS; POLYNOMIAL COMPLEXITY; PREDICTOR CORRECTOR INTERIOR POINT ALGORITHMS;

LINEAR PROGRAMMING;

EID: 0033296022     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789908805751     Document Type: Article

References (11)

1. Bonnans, J. F. and Gonzaga C. C. (1996). Convergence of interior point algorithm for the monotone linear complementarity problem, Mathematics of Operations Research, 21, 1-25.
2. Bonnans, J. F. and Potra, F. A. (1997). Infeasible path following algorithms for linear complementarity problems, Mathematics of Operations Research, 22, 378-407.
3. Gonzaga, C. C. (1992). Path following methods for linear programming, SIAM Review, 34, 167-227.
4. Kojima, M., Megiddo, N., Noma, T. and Yoshise, A. (1991). A unified approach to interior point algorithms for linear complementarity problems, Lecture Notes in Computer Science, 538. Springer Verlag, Berlin.
5. Kortanek, K., Potra, F. A. and Ye. Y. (1991). On some efficient interior point methods for nonlinear convex programming. Linear Algebra and its Applications, 152, 169-189.
6. Mizuno S. (1992). A new polynomial time method for a linear complementarity problem, Mathematical Programming, 56, 31-43.
7. Mizuno, S. and Jarre, F. Global. (1999). Polynomial-Time convergence of an infeasible-interior-point algorithm using inexact computations, Mathematical Programming, 84, 105-122.
8. Mizuno, S., Jarre, F. and Stoer, J. (1996). A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems, Applied Mathematics and Optimization, 33, 315-341.
9. Mizuno, S., Todd, M. J. and Ye Y. (1993). On adaptive step primal-dual interior-point algorithms for linear programming, Mathematics of Operations Research, 18, 964-981.
10. Portugal, L.-F., Resende, M. G. C. Veiga, G. and Judice, J. J. A truncated primal-infeasible dual-feasible network interior point method, Preprint, to appear.
11. Potra, F. A. (1996). An O(nL) infeasible interior point algorithm for LCP with quadratic convergence, Annals of Operations Research, 62, 81-102.