Skip to main content
Springer Nature Link
Log in

Polynomial interior-point algorithm for P * \({(\kappa)}\) horizontal linear complementarity problems

  • Original Paper
  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

In this paper an interior-point algorithm for P *(κ) horizontal linear complementarity problems is proposed that uses new search directions. The theoretical complexity of the new algorithm is calculated. It is investigated that the proposed algorithm has quadratically convergent with polynomial iteration complexity \(O((1+\kappa)\sqrt{n}\log\frac{n}{\varepsilon})\), coincide with the best known iteration bound for P *(κ) horizontal 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

Similar content being viewed by others

References

  1. Kojima, M., Megiddo, N., Noma, T., Yoshishe, A.: A unified approach to interior point algorithms for linear complementarity problems. Springer, Berlin (1991)

    Book  Google Scholar 

  2. Väliaho, H.: P *-matrices are just sufficient. Linear Algebra Appl. 239, 103–108 (1996)

    MathSciNet  MATH  Google Scholar 

  3. Karmarkar, N.K.: A new polynomial-time algorithm for linear programming. Combinatorica 4(4), 373–395 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  4. Anstreicher, K.M., Bosch, R.A.: A new infinity-norm path following algorithm for linear programming. SIAM J. Optim. 5(2), 236–246 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  5. 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)

    Article  MathSciNet  MATH  Google Scholar 

  6. Roos, C., Terlaky, T., Vial, J.P.: Theory and algorithms for linear optimization. An interior-point approach. John Wiley and Sons, Chichester, UK (1997) (2nd Edition, Springer (2006))

    MATH  Google Scholar 

  7. Gonzaga, C.: The largest step path following algorithm for monotone linear complementarity problems. Math. Program. 76, 309–332 (1997)

    MathSciNet  MATH  Google Scholar 

  8. Anitescu, M., Lesaja, G., Potra, F.A.: Equivalence between different formulations of the linear complementarity problem. Optim. Method Softw. 7(3), 265–290 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  9. 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 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. Mansouri, H., Roos, C.: A new full-Newton step O(n) infeasible interior-point algorithm for semidefinite optimization. Numer. Algorithms 52(2), 225–255 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Nesterov, Y.E., Nemirovski, A.S.: Interior point polynomial methods in convex programming: Theory and algorithms. SIAM Publications. SIAM, Philadelphia, USA (1993)

    Google Scholar 

  13. 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 

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

  15. 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 

  16. Mansouri, H.: Full-Newton step interior-point methods for conic optimization. PhD. thesis, Faculty of Mathematics and Computer Science, TU Delft, NL–2628 CD Delft, The Netherlands (2008)

  17. 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 

  18. Stoer, J., Wechs, M.: Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity. Math. Program. 83, 407–423 (1998)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  20. Wang, G.Q., Bai, Y.Q.: Polynomial interior-point algorithms for P *(κ) horizontal linear complementarity problem. J. Comput. Appl. Math. 233, 248–263 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  21. Huang, Z.H.: Polynomiality of high-order feasible interior point method for solving the horizontal linear complementarity problems. J. System Sci. Math. Sci. 20(4), 432–438 (2000)

    MATH  Google Scholar 

  22. Xiu, N.H., Zhang, J.Z.: A smoothing Gauss-Newton method for the generalized HLCP. J. Comput. Appl. Math. 129, 195–208 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  23. Ma, C.F., Chen, X.H.: The convergence of a one-step smoothing Newton method for P 0-NCP based on a new smoothing NCP-function. J. Comput. Appl. Math. 216(1), 1–13 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  24. Potra, F.A.: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points. Math. Program. 67(3, Ser. A), 383–406 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  25. Potra, F.A.: An infeasible-interior-point predictor-corrector algorithm for linear programming. SIAM J. Optim. 6(1), 19–32 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  26. 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 

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

    MathSciNet  MATH  Google Scholar 

  28. Achache, M.: A new primal-dual path-following method for convex quadratic programming. Comput. Appl. Math. 25(1), 97–110 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  29. Wang, G.Q., Bai, Y.Q.: A new full Nesterov-Todd step primal-dual path-follwing interior-point algorithm for symmetric optimization. J. Optim. Theory Appl. (2012). doi:10.1007/s10957-012-0013-x

    Google Scholar 

  30. Stoer, J., Wechs, M.: Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity. Math. Program. 83(3, Ser. A), 407–423 (1998)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    S. Asadi & H. Mansouri

Authors
  1. S. Asadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Mansouri
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to H. Mansouri.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Asadi, S., Mansouri, H. Polynomial interior-point algorithm for P * \({(\kappa)}\) horizontal linear complementarity problems. Numer Algor 63, 385–398 (2013). https://doi.org/10.1007/s11075-012-9628-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11075-012-9628-0

Keywords

Mathematics Subject Classifications (2010)