Skip to main content
Log in

A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with -iteration complexity

  • Published:
Mathematical Programming Submit manuscript

An Erratum to this article was published on 19 September 2006

Abstract.

An interior point method for monotone linear complementarity problems acting in a wide neighborhood of the central path is presented. The method has -iteration complexity and is superlinearly convergent even when the problem does not possess a strictly complementary solution.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    MATH  MathSciNet  Google Scholar 

  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)

    MathSciNet  MATH  Google Scholar 

  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)

    MathSciNet  Google Scholar 

  6. Hung, P-F., Ye, Y.: An asymptotical -iteration path-following linear programming algorithm that uses wide neighborhoods. SIAM J. Optim. 6(3), 159–195, August 1996

    Google Scholar 

  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)

    MathSciNet  Google Scholar 

  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)

    Google Scholar 

  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)

    MATH  MathSciNet  Google Scholar 

  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)

    MathSciNet  MATH  Google Scholar 

  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)

    MathSciNet  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    MATH  MathSciNet  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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 convergence of predictor-corrector algorithm for LCP. Math. Program. 62(3), 537–551 (1993)

    Google Scholar 

  20. Ye, Y., Güler, O., Tapia, R.A., Zhang., Y.: A quadratically convergent -iteration algorithm for linear programming. Math. Program. 59(2), 151–162 (1993)

    Google Scholar 

  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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Florian A. Potra.

Additional information

Mathematics Subject Classification (2000): 49M15, 65K05, 90C33

Work supported by the National Science Foundation under Grant No. 0139701.

An erratum to this article is available athttp://dx.doi.org/10.1007/s10107-006-0023-2.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Potra, F. A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with -iteration complexity. Math. Program., Ser. A 100, 317–337 (2004). https://doi.org/10.1007/s10107-003-0472-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-003-0472-9

Keywords

Navigation