IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v86y2023i1d10.1007_s10589-023-00482-3.html
   My bibliography  Save this article

A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems

Author

Listed:
  • Baohua Huang

    (Fujian Normal University)

  • Wen Li

    (South China Normal University)

Abstract

By equivalently transforming a class of weakly nonlinear complementarity problems into a modulus equation, and introducing a smoothing approximation of the absolute value function, a smoothing Newton method is established for solving the weakly nonlinear complementarity problem. Under some mild assumptions, the proposed method is shown to possess global convergence and locally quadratical convergence. Especially, the global convergence results do not need a priori existence of an accumulation point with some suitable conditions. Numerical results are given to show the efficiency of the proposed method.

Suggested Citation

  • Baohua Huang & Wen Li, 2023. "A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems," Computational Optimization and Applications, Springer, vol. 86(1), pages 345-381, September.
  • Handle: RePEc:spr:coopap:v:86:y:2023:i:1:d:10.1007_s10589-023-00482-3
    DOI: 10.1007/s10589-023-00482-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-023-00482-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10589-023-00482-3?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. Zhang, Xu & Peng, Zheng, 2020. "A modulus-based nonmonotone line search method for nonlinear complementarity problems," Applied Mathematics and Computation, Elsevier, vol. 387(C).
    2. Zheng, Hua & Vong, Seakweng & Liu, Ling, 2019. "A direct preconditioned modulus-based iteration method for solving nonlinear complementarity problems of H-matrices," Applied Mathematics and Computation, Elsevier, vol. 353(C), pages 396-405.
    3. C. E. Lemke, 1965. "Bimatrix Equilibrium Points and Mathematical Programming," Management Science, INFORMS, vol. 11(7), pages 681-689, May.
    4. Xia, Zechen & Li, Chenliang, 2015. "Modulus-based matrix splitting iteration methods for a class of nonlinear complementarity problem," Applied Mathematics and Computation, Elsevier, vol. 271(C), pages 34-42.
    5. Stephen M. Robinson, 1992. "Normal Maps Induced by Linear Transformations," Mathematics of Operations Research, INFORMS, vol. 17(3), pages 691-714, August.
    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. Todd S. Munson & Francisco Facchinei & Michael C. Ferris & Andreas Fischer & Christian Kanzow, 2001. "The Semismooth Algorithm for Large Scale Complementarity Problems," INFORMS Journal on Computing, INFORMS, vol. 13(4), pages 294-311, November.
    2. Zhang, Li-Li, 2021. "A modulus-based multigrid method for nonlinear complementarity problems with application to free boundary problems with nonlinear source terms," Applied Mathematics and Computation, Elsevier, vol. 399(C).
    3. Zhang, Bin, 2012. "Multi-tier binary solution method for multi-product newsvendor problem with multiple constraints," European Journal of Operational Research, Elsevier, vol. 218(2), pages 426-434.
    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. Talman, A.J.J. & van der Heyden, L., 1981. "Algorithms for the linear complementarity problem which allow an arbitrary starting point," Research Memorandum FEW 99, Tilburg University, School of Economics and Management.
    6. Bernhard von Stengel & Antoon van den Elzen & Dolf Talman, 2002. "Computing Normal Form Perfect Equilibria for Extensive Two-Person Games," Econometrica, Econometric Society, vol. 70(2), pages 693-715, March.
    7. Richard Asmuth, 1978. "Studying Economic Equilibria on Affine Networks Via Lemke's Algorithm," Discussion Papers 314, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    8. Porter, Ryan & Nudelman, Eugene & Shoham, Yoav, 2008. "Simple search methods for finding a Nash equilibrium," Games and Economic Behavior, Elsevier, vol. 63(2), pages 642-662, July.
    9. Alexander Shapiro, 2005. "Sensitivity Analysis of Parameterized Variational Inequalities," Mathematics of Operations Research, INFORMS, vol. 30(1), pages 109-126, February.
    10. Zhe Liu & Yahya Fathi, 2012. "The nearest point problem in a polyhedral set and its extensions," Computational Optimization and Applications, Springer, vol. 53(1), pages 115-130, September.
    11. 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.
    12. Zheng, Hua & Vong, Seakweng, 2021. "On the modulus-based successive overrelaxation iteration method for horizontal linear complementarity problems arising from hydrodynamic lubrication," Applied Mathematics and Computation, Elsevier, vol. 402(C).
    13. Bidard, Christian, 2014. "The Ricardian rent theory: an overview," Centro Sraffa Working Papers CSWP8, Centro di Ricerche e Documentazione "Piero Sraffa".
    14. A. T. Phillips & J. B. Rosen, 1990. "Guaranteed ϵ‐approximate solution for indefinite quadratic global minimization," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 499-514, August.
    15. 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.
    16. Christian Bidard, 2015. "An oddity property for cross-dual games," EconomiX Working Papers 2015-4, University of Paris Nanterre, EconomiX.
    17. van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2007. "A vector labeling method for solving discrete zero point and complementarity problems," Other publications TiSEM 070869d0-4e42-4d34-85f9-b, Tilburg University, School of Economics and Management.
    18. Govindan, Srihari & Wilson, Robert, 2004. "Computing Nash equilibria by iterated polymatrix approximation," Journal of Economic Dynamics and Control, Elsevier, vol. 28(7), pages 1229-1241, April.
    19. Frederic Murphy & Axel Pierru & Yves Smeers, 2016. "A Tutorial on Building Policy Models as Mixed-Complementarity Problems," Interfaces, INFORMS, vol. 46(6), pages 465-481, December.
    20. Ramadurai, Gitakrishnan & Ukkusuri, Satish V. & Zhao, Jinye & Pang, Jong-Shi, 2010. "Linear complementarity formulation for single bottleneck model with heterogeneous commuters," Transportation Research Part B: Methodological, Elsevier, vol. 44(2), pages 193-214, February.

    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:spr:coopap:v:86:y:2023:i:1:d:10.1007_s10589-023-00482-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.