Skip to main content

Advertisement

Springer Nature Link
Log in

A Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems

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

Abstract

In this paper, a full-Newton step Interior-Point Method for solving monotone Weighted Linear Complementarity Problem is designed and analyzed. This problem has been introduced recently as a generalization of the Linear Complementarity Problem with modified complementarity equation, where zero on the right-hand side is replaced with the nonnegative weight vector. With a zero weight vector, the problem reduces to a linear complementarity problem. The importance of Weighted Linear Complementarity Problem lies in the fact that it can be used for modelling a large class of problems from science, engineering and economics. Because the algorithm takes only full-Newton steps, the calculation of the step size is avoided. Under a suitable condition, the algorithm has a quadratic rate of convergence to the target point on the central path. The iteration bound for the algorithm coincides with the best iteration bound obtained for these types of 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. Potra, F.A.: Weighted complementarity problems—a new paradigm for computing equilibria. SIAM J. Optim. 2, 1634–1654 (2012)

    Article  MathSciNet  Google Scholar 

  2. Anstreicher, K.M.: Interior-point algorithms for a generalization of linear programming and weighted centering. Optim. Methods Soft. 2, 605–612 (2012)

    Article  Google Scholar 

  3. Ye, Y.: A path to the Arrow–Debreu competitive market equilibrium. Math. Program. 111, 315–348 (2008)

    Article  MathSciNet  Google Scholar 

  4. McShane, K.A.: Superlinearly convergent \(O(\sqrt{n} L)\)-iteration interior-point algorithms for linear programming and the monotone linear complementarity problem. SIAM J. Optim. 4, 247–261 (1994)

    Article  MathSciNet  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, 964–981 (1993)

    Article  MathSciNet  Google Scholar 

  6. Potra, F.A.: Sufficient weighted complementarity problems. Comput. Optim. Appl. 64, 467–488 (2016)

    Article  MathSciNet  Google Scholar 

  7. Cottle, R.W., Pang, J.-S., Venkateswaran, V.: Sufficient matrices and the linear complementarity problem. Linear Algebra Appl. 114(115), 231–249 (1989)

    Article  MathSciNet  Google Scholar 

  8. Zhang, J.: A smoothing Newton algorithm for weighted linear complementarity problem. Optim. Lett. 10, 499–509 (2016)

    Article  MathSciNet  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  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  12. Asadi, S., Mansouri, H., Darvay, Zs: An infeasible full-NT step IPM for \(P_*(\kappa )\) horizontal linear complementarity problem over Cartesian product of symmetric cones. Optimization 66, 225–250 (2017)

    Article  MathSciNet  Google Scholar 

  13. Achache, M., Tabchouche, N.: A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems. Optim. Lett. 13, 1039–1057 (2019)

    Article  MathSciNet  Google Scholar 

  14. Lesaja, G., Potra, F.A.: Adaptive full Newton-step infeasible interior-point method for sufficient horizontal LCP. Optim. Methods Softw. 34, 1014–1034 (2018)

    Article  MathSciNet  Google Scholar 

  15. Darvay, Zs: A weighted-path-following method for linear optimization. Stud. Univ. Babeş–Bolyai Inf. 47, 3–12 (2002)

    MathSciNet  MATH  Google Scholar 

  16. Achache, M.: A weighted-path-following method for the linear complementarity problem. Stud. Univ. Babeş–Bolyai Inf. 49, 61–73 (2004)

    MathSciNet  MATH  Google Scholar 

  17. Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Volume 538 of Lecture Notes in Computer Science. Springer, New York (1991)

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

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The work of the first author is supported by a Grant from Iran’s National Elites Foundation, Project No. 15/2080. The first and the fourth authors thank Sharif University of Technology for supporting this work. The first author would also like to thank the support from the University of Applied Sciences and Arts, Northwestern Switzerland. The second author would like to thank the support of Babeş-Bolyai University.

Author information

Authors and Affiliations

  1. Faculty of Mathematical Sciences, Sharif University of Technology, Tehran, Iran

    Soodabeh Asadi & Nezam Mahdavi-Amiri

  2. Institute for Data Science, School of Engineering, University of Applied Sciences and Arts Northwestern Switzerland, Windisch, Switzerland

    Soodabeh Asadi

  3. Faculty of Mathematics and Computer Science, Babeş-Bolyai University, No. 1 Mihail Kogalniceanu Street, 400084, Cluj-Napoca, Romania

    Zsolt Darvay

  4. Department of Mathematics, US Naval Academy, Annapolis, MD, USA

    Goran Lesaja

  5. Department of Mathematical Sciences, Georgia Southern University, Statesboro, GA, USA

    Goran Lesaja

  6. Department of Mathematics and Statistics, University of Maryland, Baltimore County, MD, USA

    Florian Potra

Authors
  1. Soodabeh Asadi
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Zsolt Darvay
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Goran Lesaja
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Nezam Mahdavi-Amiri
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Florian Potra
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Goran Lesaja.

Additional information

Communicated by Nobuo Yamashita.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Asadi, S., Darvay, Z., Lesaja, G. et al. A Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems. J Optim Theory Appl 186, 864–878 (2020). https://doi.org/10.1007/s10957-020-01728-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-020-01728-4

Keywords

Mathematics Subject Classification