IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v298y2022i1p25-35.html
   My bibliography  Save this article

Predictor-corrector interior-point algorithm for P*(κ)-linear complementarity problems based on a new type of algebraic equivalent transformation technique

Author

Listed:
  • Darvay, Zsolt
  • Illés, Tibor
  • Rigó, Petra Renáta

Abstract

We propose a new predictor-corrector (PC) interior-point algorithm (IPA) for solving linear complementarity problem (LCP) with P*(κ)-matrices. The introduced IPA uses a new type of algebraic equivalent transformation (AET) on the centering equations of the system defining the central path. The new technique was introduced by Darvay and Takács (2018) for linear optimization. The search direction discussed in this paper can be derived from positive-asymptotic kernel function using the function φ(t)=t2 in the new type of AET. We prove that the IPA has O((1+4κ)nlog3nμ04ϵ) iteration complexity, where κ is an upper bound of the handicap of the input matrix. To the best of our knowledge, this is the first PC IPA for P*(κ)-LCPs which is based on this search direction.

Suggested Citation

  • Darvay, Zsolt & Illés, Tibor & Rigó, Petra Renáta, 2022. "Predictor-corrector interior-point algorithm for P*(κ)-linear complementarity problems based on a new type of algebraic equivalent transformation technique," European Journal of Operational Research, Elsevier, vol. 298(1), pages 25-35.
    • Handle: RePEc:eee:ejores:v:298:y:2022:i:1:p:25-35
    DOI: 10.1016/j.ejor.2021.08.039
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721007311
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2021.08.039?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. De Panne, C & Whinston, Andrew, 1969. "The Symmetric Formulation of the Simplex Method for Quadratic Programming," Econometrica, Econometric Society, vol. 37(3), pages 507-527, July.
    2. Adrienn Csizmadia & Zsolt Csizmadia & Tibor Illés, 2018. "Finiteness of the quadratic primal simplex method when s-monotone index selection rules are applied," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(3), pages 535-550, September.
    3. Shinji Mizuno & Michael J. Todd & Yinyu Ye, 1993. "On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming," Mathematics of Operations Research, INFORMS, vol. 18(4), pages 964-981, November.
    4. T. Illés & M. Nagy & T. Terlaky, 2009. "EP Theorem for Dual Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 140(2), pages 233-238, February.
    5. C. van de Panne & Andrew Whinston, 1964. "Simplicial methods for quadratic programming," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 11(3‐4), pages 273-302, September.
    6. Illes, Tibor & Nagy, Marianna, 2007. "A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1097-1111, September.
    7. H. Mansouri & M. Pirhaji, 2013. "A Polynomial Interior-Point Algorithm for Monotone Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 157(2), pages 451-461, May.
    8. Tibor Illés & Marianna Nagy & Tamás Terlaky, 2010. "A polynomial path-following interior point algorithm for general linear complementarity problems," Journal of Global Optimization, Springer, vol. 47(3), pages 329-342, July.
    9. Petra Renáta Rigó & Zsolt Darvay, 2018. "Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier," Computational Optimization and Applications, Springer, vol. 71(2), pages 483-508, November.
    10. Zs. Darvay & T. Illés & B. Kheirfam & P. R. Rigó, 2020. "A corrector–predictor interior-point method with new search direction for linear optimization," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(3), pages 1123-1140, September.
    11. M. Seetharama Gowda & Jong-Shi Pang, 1992. "On Solution Stability of the Linear Complementarity Problem," Mathematics of Operations Research, INFORMS, vol. 17(1), pages 77-83, February.
    12. Carmo Brás & Gabriele Eichfelder & Joaquim Júdice, 2016. "Copositivity tests based on the linear complementarity problem," Computational Optimization and Applications, Springer, vol. 63(2), pages 461-493, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zsolt Darvay & Petra Renáta Rigó, 2024. "New Predictor–Corrector Algorithm for Symmetric Cone Horizontal Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 202(1), pages 50-75, July.
    2. Tibor Illés & Petra Renáta Rigó & Roland Török, 2024. "Unified Approach of Interior-Point Algorithms for $$P_*(\kappa )$$ P ∗ ( κ ) -LCPs Using a New Class of Algebraically Equivalent Transformations," Journal of Optimization Theory and Applications, Springer, vol. 202(1), pages 27-49, July.
    3. Marianna E.-Nagy & Tibor Illés & Janez Povh & Anita Varga & Janez Žerovnik, 2024. "Sufficient Matrices: Properties, Generating and Testing," Journal of Optimization Theory and Applications, Springer, vol. 202(1), pages 204-236, July.
    4. Zsolt Darvay & Petra Renáta Takács, 2018. "Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(3), pages 551-563, September.
    5. Y. B. Zhao & J. Y. Han, 1999. "Two Interior-Point Methods for Nonlinear P *(τ)-Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 102(3), pages 659-679, September.
    6. Behrouz Kheirfam, 2014. "A New Complexity Analysis for Full-Newton Step Infeasible Interior-Point Algorithm for Horizontal Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 161(3), pages 853-869, June.
    7. Petra Renáta Rigó & Zsolt Darvay, 2018. "Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier," Computational Optimization and Applications, Springer, vol. 71(2), pages 483-508, November.
    8. Behrouz Kheirfam, 2024. "Complexity Analysis of a Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 202(1), pages 133-145, July.
    9. Karan N. Chadha & Ankur A. Kulkarni, 2022. "On independent cliques and linear complementarity problems," Indian Journal of Pure and Applied Mathematics, Springer, vol. 53(4), pages 1036-1057, December.
    10. Botond Bertók & Tibor Csendes & Tibor Jordán, 2019. "Editorial," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(2), pages 325-327, June.
    11. Hoang Ngoc Tuan, 2015. "Boundedness of a Type of Iterative Sequences in Two-Dimensional Quadratic Programming," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 234-245, January.
    12. Xiao Wang & Xinzhen Zhang & Guangming Zhou, 2020. "SDP relaxation algorithms for $$\mathbf {P}(\mathbf {P}_0)$$P(P0)-tensor detection," Computational Optimization and Applications, Springer, vol. 75(3), pages 739-752, April.
    13. Chee-Khian Sim, 2019. "Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence," Computational Optimization and Applications, Springer, vol. 74(2), pages 583-621, November.
    14. Zhang, Yongxiong & Zheng, Hua & Lu, Xiaoping & Vong, Seakweng, 2023. "Modulus-based synchronous multisplitting iteration methods without auxiliary variable for solving vertical linear complementarity problems," Applied Mathematics and Computation, Elsevier, vol. 458(C).
    15. Guo-qiang Wang & Yu-jing Yue & Xin-zhong Cai, 2009. "Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem," Fuzzy Information and Engineering, Springer, vol. 1(4), pages 435-445, December.
    16. van der Laan, Gerard & Talman, Dolf & Yang, Zaifu, 2011. "Solving discrete systems of nonlinear equations," European Journal of Operational Research, Elsevier, vol. 214(3), pages 493-500, November.
    17. Zheng-Hai Huang & Yu-Fan Li & Yong Wang, 2023. "A fixed point iterative method for tensor complementarity problems with the implicit Z-tensors," Journal of Global Optimization, Springer, vol. 86(2), pages 495-520, June.
    18. Christoph Böhringer & Thomas F. Rutherford, 2017. "Paris after Trump: An Inconvenient Insight," CESifo Working Paper Series 6531, CESifo.
    19. G. L. Zhou & L. Caccetta, 2008. "Feasible Semismooth Newton Method for a Class of Stochastic Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 379-392, November.
    20. A. K. Das, 2016. "Properties of some matrix classes based on principal pivot transform," Annals of Operations Research, Springer, vol. 243(1), pages 375-382, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:298:y:2022:i:1:p:25-35. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.