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

A generalized Newton method for a class of discrete-time linear complementarity systems

Author

Listed:
  • Sun, Zhe
  • Yang, Xiaoqi

Abstract

In this paper, we propose a generalized Newton method for solving a class of discrete-time linear complementarity systems consisting of a system of linear equations and a linear complementarity constraints with a Z-matrix. We obtain a complete characterization of the least element solution of a linear complementarity problem with a Z-matrix that a solution is the least element solution if and only if the principal submatrix corresponding to the nonzero components of the solution is an M-matrix. We present a Newton method for solving a linear complementarity problem with a Z-matrix. We propose a generalized Newton method for solving the discrete-time linear complementarity system where the linear complementarity problem constraint is solved by the proposed Newton method. Under suitable conditions, we show that the generalized Newton method converges globally and finds a solution in finitely many iterations. Preliminary numerical results show the efficiency of the proposed method.

Suggested Citation

  • Sun, Zhe & Yang, Xiaoqi, 2020. "A generalized Newton method for a class of discrete-time linear complementarity systems," European Journal of Operational Research, Elsevier, vol. 286(1), pages 39-48.
    • Handle: RePEc:eee:ejores:v:286:y:2020:i:1:p:39-48
    DOI: 10.1016/j.ejor.2020.03.058
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221720302885
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2020.03.058?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. Polyak, B.T., 2007. "Newton's method and its use in optimization," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1086-1096, September.
    2. 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.
    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. 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.
    2. 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.
    3. 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.
    4. 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).
    5. 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.
    6. 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.
    7. 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.
    8. Christoph Böhringer & Thomas F. Rutherford, 2017. "Paris after Trump: An Inconvenient Insight," CESifo Working Paper Series 6531, CESifo.
    9. 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.
    10. 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.
    11. Meijuan Shang & Chao Zhang & Naihua Xiu, 2014. "Minimal Zero Norm Solutions of Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 163(3), pages 795-814, December.
    12. Massol, Olivier & Rifaat, Omer, 2018. "Phasing out the U.S. Federal Helium Reserve: Policy insights from a world helium model," Resource and Energy Economics, Elsevier, vol. 54(C), pages 186-211.
    13. S. R. Mohan, 1997. "Degeneracy Subgraph of the Lemke Complementary Pivot Algorithm and Anticycling Rule," Journal of Optimization Theory and Applications, Springer, vol. 94(2), pages 409-423, August.
    14. Thiruvankatachari Parthasarathy & Gomatam Ravindran & Sunil Kumar, 2022. "On Semimonotone Matrices, $$R_0$$ R 0 -Matrices and Q-Matrices," Journal of Optimization Theory and Applications, Springer, vol. 195(1), pages 131-147, October.
    15. Y. P. Fang & N. J. Huang, 2006. "Feasibility and Solvability for Vector Complementarity Problems1," Journal of Optimization Theory and Applications, Springer, vol. 129(3), pages 373-390, June.
    16. Xiaojun Chen & Yun Shi & Xiaozhou Wang, 2020. "Equilibrium Oil Market Share under the COVID-19 Pandemic," Papers 2007.15265, arXiv.org.
    17. van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2005. "Computing Integral Solutions of Complementarity Problems," Other publications TiSEM b8e0c74e-2219-4ab0-99a2-0, Tilburg University, School of Economics and Management.
    18. Niu, Yi-Shuai & Júdice, Joaquim & Le Thi, Hoai An & Pham, Dinh Tao, 2019. "Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem," Applied Mathematics and Computation, Elsevier, vol. 353(C), pages 95-113.
    19. 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.
    20. Giandomenico Mastroeni & Letizia Pellegrini & Alberto Peretti, 2021. "Some numerical aspects on a method for solving linear problems with complementarity constraints," Working Papers 16/2021, University of Verona, Department of Economics.

    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:286:y:2020:i:1:p:39-48. 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.