Erratum: A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with O(√nL)-iteration complexity (Mathematical Programming, Series A DOI: 10.1007/s10107-003-0472-9);A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with O(√nL)-iteration complexity

Mathematical Programming

Volumn 100, Issue 2, 2004, Pages 317-337

  Potra, Florian A ^a  

^a UNIVERSITY OF MARYLAND BALTIMORE COUNTY   (United States)

Author keywords

Interior point algorithm; Large neighbourhood; Linear complementarity problem; Superlinear convergence; Large neighborhood

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; INTEGRATION; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

INTERIOR-POINT ALGORITHM; LARGE NEIGHBOURHOOD; LINEAR COMPLEMENTARITY PROBLEMS; SUPERLINEAR CONVERGENCE;

LINEAR PROGRAMMING;

EID: 21144457240     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0023-2     Document Type: Erratum

References (21)

1. Anitescu, M., Lesaja, G., Potra, F.A.: An infeasible-interior-point predictor-corrector algorithm for the P*-Geometric LCP. Appl. Math. Optim. 36(2), 203-228 (1997)
2. Anstreicher, K.M., Bosch, R.A.: A new infinity-norm path following algorithm for linear programming. SIAM J. Optim. 5(2), 236-246 (1995)
3. Bonnans, J.F., Gonzaga, C.C.: Convergence of interior point algorithms for the monotone linear complementarity problem. Math. Oper. Res. 21, 1-25 (1996)
4. Cottle, R.W., Pang, J.-S., Stone, R.E.: The Linear Complementarity Problem. Academic Press, Boston, MA, 1992
5. Gonzaga., C.C.: Complexity of predictor-corrector algorithms for LCP based on a large neighborhood of the central path. SIAM J. Optim. 10(1), 183-194 (electronic), (1999)
6. Hung, P-F., Ye, Y.: An asymptotical (O √nL)-iteration path-following linear programming algorithm that uses wide neighborhoods. SIAM J. Optim. 6(3), 159-195, August 1996
7. Jansen, B., Roos, C., Terlaky, T., Vial., J.-P: Primal-dual algorithms for linear programming based on the logarithmic barrier method. J. Optim. Theory Appl. 83(1), 1-26 (1994)
8. Ji, J., Potra, F.A., Huang., S.: A predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence. J. Optim. Theory and Appl. 84(1), 187-199 (1995)
9. Kojima, M., Megiddo, N., Noma, T., Yoshise., A.: A unified approach to interior point algorithms for linear complementarity problems. Lecture Notes in Comput. Sci. 538, (1991)
10. Mizuno, S., Todd, M.J., Ye., Y.: On adaptive-step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18(4), 964-981 (1993)
11. Monteiro, R.D.C., Wright., S.J.: Local convergence of interior-point algorithms for degenerate monotone LCP. Computational Optim. Appl. 3, 131-155 (1994)
12. Monteiro, R.C., Adler, I., Resende., M.G.: A polynomial-time primal-dual affine scalling algorithm for linear and convex quadratic programming and its power series extension. Math. Oper. Res. 15, 191-214 (1990)
13. Potra., F.A.: The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path. Eur. J. Oper. Res. 143, 257-267 (2002)
14. Roos, C., Vial, J.-Ph., Terlaky, T.: Theory and Algorithms for Linear Optimization : An Interior Point Approach. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley and Sons, 1997
15. Stoer, J., Wechs, M., Mizuno., S. : High order infeasible-interior-point methods for solving sufficient linear complementarity problems. Math. Oper. Res. 23(4), 832-862 (1998)
16. Sturm., J.F.: Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists. Math. Oper. Res. 24, 72-94 (1999)
17. Wright, S.J.: Primal-Dual Interior-Point Methods. SIAM Publications, Philadephia, 1997
18. Ye, Y.: Interior Point Algorithms: Theory and Analysis. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley and Sons, 1997
19. Ye, Y., Anstreicher., K.: On quadratic and O(√nL) convergence of predictor-corrector algorithm for LCP. Math. Program. 62(3), 537-551 (1993)
20. Ye, Y., Güler, O., Tapia, R.A., Zhang., Y.: A quadratically convergent O(√nL)-iteration algorithm for linear programming. Math. Program. 59(2), 151-162 (1993)
21. Zhao., G.: Interior point algorithms for linear complementarity problems based on large neighborhoods of the central path. SIAM J. Optim. 8(2), 397-413 (electronic), (1998)