Skip to main content
Log in

Some non-interior path-following methods based on a scaled central path for linear complementarity problems

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

In this paper we present some non-interior path-following methods for linear complementarity problems. Instead of using the standard central path we use a scaled central path. Based on this new central path, we first give a feasible non-interior path-following method for linear complementarity problems. And then we extend it to an infeasible method. After proving the boundedness of the neighborhood, we prove the convergence of our method. Another point we should present is that we prove the local quadratic convergence of feasible method without the assumption of strict complementarity at the 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. Burke, J., Xu, S.: The global linear convergence of a non-interior path-following algorithm for linear complementarity problems Math. Oper. Res. 23, 719–734 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Burke, J., Xu, S.: A non-interior predictor-corrector path-following algorithm for LCP. In: Fukushima, M., Qi, L. (eds.) Reformulation: Nonsmooth, Piecewise Smooth and Smoothing Methods, pp. 45–64. Kluwer Academic, Boston (1999)

    Google Scholar 

  3. Burke, J., Xu, S.: A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem. Math. Program. 87, 113–130 (2000)

    MATH  MathSciNet  Google Scholar 

  4. Burke, J., Xu, S.: Complexity of a noninterior path-following method for the linear complementarity problem. J. Optim. Theory Appl. 112, 53–76 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chen, B., Harker, P.T.: A non-interior-point continuation method for linear complementarity problem. SIAM J. Matrix Anal. Appl. 14, 1168–1190 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  6. Chen, B., Harker, P.T.: Smooth approximations to nonlinear complementarity problems. SIAM J. Optim. 7, 403–420 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  7. Chen, B., Xiu, N.: A global linear and local quadratic non-interior continuation method for nonlinear complementarity problems based on Chen-Mangasarian smoothing functions. SIAM J. Optim. 9, 605–623 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. Chen, B., Xiu, N.: Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity. J. Optim. Theory Appl. 108, 317–332 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  9. Chen, C., Mangasarian, O.L.: A class of smoothing functions for nonlinear and mixed complementarity problems. Comput. Optim. Appl. 5, 97–138 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  10. Fukushima, M., Luo, Z.-Q., Pang, J.-S.: A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints. Comput. Optim. Appl. 10, 5–34 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  11. Gabrial, S.A., Moré, J.J.: Smoothing of mixed complementarity problems. In: Ferris, M.C., Pang, J.S. (eds.) Complementarity and Variational Problems: State of the Art, pp. 105–116. SIAM, Philadelphia (1996)

    Google Scholar 

  12. Hotta, K., Yoshise, A.: Global convergence of a non-interior-point algorithms using Chen-Harker-Kanzow functions for nonlinear complementarity problems. Math. Program. 86, 105–133 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  13. Hotta, K., Yoshise, A.: A complexity bound of a predictor-corrector smoothing method using CHKS-functions for monotone LCP. Comput. Optim. Appl. 22, 329–350 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  14. Huang, Z., et al.: The non-interior continuation methods for solving the P 0 function nonlinear complementarity problem. Sci. China Ser. A 44, 1107–1114 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kanzow, C.: Some noninterior continuation methods for complementarity problems. SIAM J. Matrix Anal. Appl. 17, 851–868 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  16. Qi, L., Sun, D.: Improving the convergence of non-interior point algorithm for nonlinear complementarity problems. Math. Comput. 69, 283–304 (2000)

    MATH  MathSciNet  Google Scholar 

  17. Qi, L., Sun, J.: A nonsmooth version of Newton’s method. Math. Program. 58, 353–367 (1993)

    Article  MathSciNet  Google Scholar 

  18. Smale, S.: Algorithms for solving equations. In: Gleason, A.M. (ed.) Proceedings of the International Congress of Mathematicians, pp. 172–195. Am. Math. Soc., Providence (1987)

    Google Scholar 

  19. Tseng, P.: Analysis of a non-interior continuation method based on Chen-Mangasarian smoothing functions for complementarity problems. In: Fukushima, M., Qi, L. (eds.) Reformulation-Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, pp. 381–404. Kluwer Academic, Boston (1999)

    Google Scholar 

  20. Xiu, N.: New methods for complementarity problems. Ph.D. Dissertation, Institute of Applied Mathematics, Academia Sinica, Beijing 100080, China (1997)

  21. Xu, S.: The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform P-functions. Math. Program. 87, 501–517 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  22. Yuan, Y.X.: A scaled central path for linear programming. J. Comput. Math. 19, 35–40 (2001)

    MATH  MathSciNet  Google Scholar 

  23. Zhao, Y., Li, D.: Existence and limiting behavior of a non-interior-point trajectory for nonlinear complementarity problems without strict feasibility condition. SIAM J. Control. Optim. 40, 898–924 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yang Qingzhi.

Additional information

This work is supported by the national natural science foundation of China, Grant 10571134.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Qinggang, W., Jinling, Z. & Qingzhi, Y. Some non-interior path-following methods based on a scaled central path for linear complementarity problems. Comput Optim Appl 46, 31–49 (2010). https://doi.org/10.1007/s10589-008-9188-3

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-008-9188-3

Keywords

Navigation