Skip to main content
SpringerLink
Log in

A predictor-corrector interior-point algorithm for \(P_{*}(\kappa )\)-horizontal linear complementarity problem

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

Abstract

We present a predictor-corrector path-following interior-point algorithm for \(P_*(\kappa )\) horizontal linear complementarity problem based on new search directions. In each iteration, the algorithm performs two kinds of steps: a predictor (damped Newton) step and a corrector (full Newton) step. The full Newton-step is generated from an algebraic reformulation of the centering equation, which defines the central path and seeks directions in a small neighborhood of the central path. While the damped Newton step is used to move in the direction of optimal solution and reduce the duality gap. We derive the complexity for the algorithm, which coincides with the best known iteration bound for \(P_*(\kappa )\)-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

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. 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  MATH  MathSciNet  Google Scholar 

  2. Asadi, S., Mansouri, H.: Polynomial interior-point algorithm for \(P_*(\kappa )\)-horizontal linear complementarity problems. Numer. Algorithms 63(2), 385-398 (2013)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  4. Darvay, Z.: A new predictor-corrector algorithm for linear programming. Alkalmazott matematikai lapok 22, 135–161 (2005). In hungarian

    MATH  MathSciNet  Google Scholar 

  5. 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  MATH  MathSciNet  Google Scholar 

  6. Illés, T., Nagy, M.: A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems. Eur. J. Oper. Res. 181, 1097–1111 (2007)

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  8. Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems Lecture Notes in Computer Science, vol. 538. Springer-Verlag, Berlin (1991)

    Book  Google Scholar 

  9. Lesaja, G., Roos, C.: Unified analysis of kernel-based interior-point methods for \(P_*(\kappa )\)-linear complementarity problems. SIAM J. Optim. 20(6), 3011–3039 (2010)

    Article  MathSciNet  Google Scholar 

  10. Mizuno, S., Todd, M.J., Ye, Y.: On adaptive-step primal-dual interior point algorithms for linear programming. Math. Oper. Res. 18, 964–981 (1993)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  13. Wang, G.Q., Bai, Y.Q.: Polynomial interior-point algorithm for \(P_*(\kappa )\) horizontal linear complementarity problem. J. Comput. Appl. Math. 233, 248–263 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  14. Zhang, Y.: On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem. SIAM J. Optim. 4(1), 208–227 (1994)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran

    Behrouz Kheirfam

Authors
  1. Behrouz Kheirfam
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Behrouz Kheirfam.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kheirfam, B. A predictor-corrector interior-point algorithm for \(P_{*}(\kappa )\)-horizontal linear complementarity problem. Numer Algor 66, 349–361 (2014). https://doi.org/10.1007/s11075-013-9738-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11075-013-9738-3

Keywords

Mathematics Subject Classifications (2010)

Search

Navigation