Skip to main content
Springer Nature Link
Log in

A Polynomial Interior-Point Algorithm for Monotone Linear Complementarity Problems

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

In this paper, we propose an interior-point algorithm for monotone linear complementarity problems. The algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only full-Newton steps. Moreover, it is proven that the number of iterations of the algorithm coincides with the well-known best iteration bound for monotone linear complementarity problems.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  1. Karmarkar, N.: New polynomial-time algorithm for linear programming. Combinatorica 4, 373–395 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  2. Potra, F.A., Stoer, J.: On a class of superlinearly convergent polynomial time interior point methods for sufficient LCP. SIAM J. Optim. 20(3), 1333–1363 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Potra, F.A.: An O(nL) infeasible interior-point algorithm for LCP with quadratic convergence. Ann. Oper. Res. 62, 81–102 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  4. Gurtuna, F., Petra, C., Potra, F.A., Shevchenko, O., Vancea, A.: Corrector-predictor methods for sufficient linear complementarity problems. Comput. Optim. Appl. 48(3), 453–485 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Peng, J., Roos, C., Terlaky, T.: Self-regular functions and new search directions for linear and semidefinite optimization. Math. Program., Ser. A 93(1), 129–171 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ai, W.B., Zhang, S.Z.: An \(o(\sqrt{n}L)\) iteration primal–dual path-following method, based on wide neighborhoods and large updates, for monotone linear complementarity problems. SIAM J. Optim. 16(2), 400–417 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bai, Y.Q., El Ghami, M., Roos, C.: A comparative study of kernel functions for primal–dual interior-point algorithms in linear optimization. SIAM J. Optim. 15(1), 101–128 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  8. Peng, J., Roos, C., Terlaky, T.: Self-Regularity. A New Paradigm for Primal–Dual Interior-Point Algorithms. Princeton University Press, Princeton (2002)

    MATH  Google Scholar 

  9. Mansouri, H., Zangiabadi, M., Pirhaji, M.: A full-Newton step o(n) infeasible interior-point algorithm for linear complementarity problems. Nonlinear Anal., Real World Appl. 12, 545–561 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. Zangiabadi, M., Mansouri, H.: Improved infeasible-interior-point algorithm for linear complementarity problems. Bull. Iran. Math. Soc. (2011, in press)

  11. Mansouri, H., Roos, C.: Simplified O(n) infeasible interior-point algorithm for linear optimization using full-Newton step. Optim. Methods Softw. 22(3), 519–530 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Mansouri, H.: Full-Newton step interior-point methods for conic optimization. Ph.D. Thesis, Faculty of Mathematics and Computer Science, TU Delft, 2628 CD Delft, The Netherlands (2008)

  13. Roos, C.: A full-Newton step O(n) infeasible interior-point algorithm for linear optimization. SIAM J. Optim. 16(4), 1110–1136 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  14. Darvay, Z.: New interior-point algorithms in linear optimization. Adv. Model. Optim. 5(1), 51–92 (2003)

    MathSciNet  MATH  Google Scholar 

  15. Hock, W., Shittkowski, K.: Test Examples for Nonlinear Programming Codes. Lecture Notes in Econom. and Math. Systems, vol. 187. Springer, Berlin (1981)

    Book  MATH  Google Scholar 

  16. Harker, P.T., Pang, J.S.: A damped Newton method for linear complementarity problem. In: Simulation and Optimization of Large Systems. Lectures Appl. Math., vol. 26, pp. 265–284 (1990)

    Google Scholar 

  17. Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. Lecture Notes in Comput. Sci., vol. 538. Springer, Berlin (1991)

    Book  Google Scholar 

Download references

Acknowledgements

Authors wish to thank Professor Florian Potra and three anonymous referees for useful comments and suggestions on an earlier draft of the manuscript. The first author would like to express gratitude for the financial grant from Shahrekord University.

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Faculty of Mathematical Sciences, Shahrekord University, P.O. Box 115, Shahrekord, Iran

    H. Mansouri & M. Pirhaji

Authors
  1. H. Mansouri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Pirhaji
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to H. Mansouri.

Additional information

Communicated by Nobuo Yamashita.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mansouri, H., Pirhaji, M. A Polynomial Interior-Point Algorithm for Monotone Linear Complementarity Problems. J Optim Theory Appl 157, 451–461 (2013). https://doi.org/10.1007/s10957-012-0195-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-012-0195-2

Keywords