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

A trust-region LP-Newton method for constrained nonsmooth equations under Hölder metric subregularity

Author

Listed:
  • Letícia Becher

    (Federal University of Paraná)

  • Damián Fernández

    (CIEM-CONICET, FAMAF-Universidad Nacional de Córdoba)

  • Alberto Ramos

    (Universidad de Tarapacá)

Abstract

We describe and analyze a globally convergent algorithm to find a possible nonisolated zero of a piecewise smooth mapping over a polyhedral set. Such formulation includes Karush–Kuhn–Tucker systems, variational inequalities problems, and generalized Nash equilibrium problems. Our algorithm is based on a modification of the fast locally convergent Linear Programming (LP)-Newton method with a trust-region strategy for globalization that makes use of the natural merit function. The transition between global and local convergence occurs naturally under mild assumption. Our local convergence analysis of the method is performed under a Hölder metric subregularity condition of the mapping defining the possibly nonsmooth equation and the Hölder continuity of the derivative of the selection mapping. We present numerical results that show the feasibility of the approach.

Suggested Citation

  • Letícia Becher & Damián Fernández & Alberto Ramos, 2023. "A trust-region LP-Newton method for constrained nonsmooth equations under Hölder metric subregularity," Computational Optimization and Applications, Springer, vol. 86(2), pages 711-743, November.
    • Handle: RePEc:spr:coopap:v:86:y:2023:i:2:d:10.1007_s10589-023-00498-9
    DOI: 10.1007/s10589-023-00498-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-023-00498-9
    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-00498-9?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. Koichi Nabetani & Paul Tseng & Masao Fukushima, 2011. "Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints," Computational Optimization and Applications, Springer, vol. 48(3), pages 423-452, April.
    2. Harker, Patrick T., 1991. "Generalized Nash games and quasi-variational inequalities," European Journal of Operational Research, Elsevier, vol. 54(1), pages 81-94, September.
    3. Roberto Andreani & José Mario Martínez & Alberto Ramos & Paulo J. S. Silva, 2018. "Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 693-717, 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. Alexey Izmailov & Mikhail Solodov, 2014. "On error bounds and Newton-type methods for generalized Nash equilibrium problems," Computational Optimization and Applications, Springer, vol. 59(1), pages 201-218, October.
    2. Migot, Tangi & Cojocaru, Monica-G., 2020. "A parametrized variational inequality approach to track the solution set of a generalized nash equilibrium problem," European Journal of Operational Research, Elsevier, vol. 283(3), pages 1136-1147.
    3. Le Cadre, Hélène & Mou, Yuting & Höschle, Hanspeter, 2022. "Parametrized Inexact-ADMM based coordination games: A normalized Nash equilibrium approach," European Journal of Operational Research, Elsevier, vol. 296(2), pages 696-716.
    4. Han, Deren & Zhang, Hongchao & Qian, Gang & Xu, Lingling, 2012. "An improved two-step method for solving generalized Nash equilibrium problems," European Journal of Operational Research, Elsevier, vol. 216(3), pages 613-623.
    5. Hélène Le Cadre & Yuting Mou & Hanspeter Höschle, 2020. "Parametrized Inexact-ADMM to Span the Set of Generalized Nash Equilibria: A Normalized Equilibrium Approach," Working Papers hal-02925005, HAL.
    6. Axel Dreves, 2019. "An algorithm for equilibrium selection in generalized Nash equilibrium problems," Computational Optimization and Applications, Springer, vol. 73(3), pages 821-837, July.
    7. Axel Dreves, 2018. "How to Select a Solution in Generalized Nash Equilibrium Problems," Journal of Optimization Theory and Applications, Springer, vol. 178(3), pages 973-997, September.
    8. Le Cadre, Hélène & Jacquot, Paulin & Wan, Cheng & Alasseur, Clémence, 2020. "Peer-to-peer electricity market analysis: From variational to Generalized Nash Equilibrium," European Journal of Operational Research, Elsevier, vol. 282(2), pages 753-771.
    9. Baasansuren Jadamba & Fabio Raciti, 2015. "On the Modeling of Some Environmental Games with Uncertain Data," Journal of Optimization Theory and Applications, Springer, vol. 167(3), pages 959-968, December.
    10. L. F. Bueno & G. Haeser & F. Lara & F. N. Rojas, 2020. "An Augmented Lagrangian method for quasi-equilibrium problems," Computational Optimization and Applications, Springer, vol. 76(3), pages 737-766, July.
    11. Jiawang Nie & Xindong Tang & Lingling Xu, 2021. "The Gauss–Seidel method for generalized Nash equilibrium problems of polynomials," Computational Optimization and Applications, Springer, vol. 78(2), pages 529-557, March.
    12. Huppmann, Daniel & Siddiqui, Sauleh, 2018. "An exact solution method for binary equilibrium problems with compensation and the power market uplift problem," European Journal of Operational Research, Elsevier, vol. 266(2), pages 622-638.
    13. Giorgia Oggioni and Yves Smeers, 2012. "Degrees of Coordination in Market Coupling and Counter-Trading," The Energy Journal, International Association for Energy Economics, vol. 0(Number 3).
    14. Sreekumaran, Harikrishnan & Hota, Ashish R. & Liu, Andrew L. & Uhan, Nelson A. & Sundaram, Shreyas, 2021. "Equilibrium strategies for multiple interdictors on a common network," European Journal of Operational Research, Elsevier, vol. 288(2), pages 523-538.
    15. Axel Dreves & Christian Kanzow, 2011. "Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems," Computational Optimization and Applications, Springer, vol. 50(1), pages 23-48, September.
    16. Giorgia Oggioni & Yves Smeers & Elisabetta Allevi & Siegfried Schaible, 2012. "A Generalized Nash Equilibrium Model of Market Coupling in the European Power System," Networks and Spatial Economics, Springer, vol. 12(4), pages 503-560, December.
    17. repec:diw:diwwpp:dp1566 is not listed on IDEAS
    18. Nadja Harms & Tim Hoheisel & Christian Kanzow, 2015. "On a Smooth Dual Gap Function for a Class of Player Convex Generalized Nash Equilibrium Problems," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 659-685, August.
    19. Gabriel Haeser & Alberto Ramos, 2020. "Constraint Qualifications for Karush–Kuhn–Tucker Conditions in Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 187(2), pages 469-487, November.
    20. repec:diw:diwwpp:dp1298 is not listed on IDEAS
    21. Andreas Ehrenmann & Karsten Neuhoff, 2009. "A Comparison of Electricity Market Designs in Networks," Operations Research, INFORMS, vol. 57(2), pages 274-286, April.
    22. Wen Zhou & Nikita Koptyug & Shutao Ye & Yifan Jia & Xiaolong Lu, 2016. "An Extended N-Player Network Game and Simulation of Four Investment Strategies on a Complex Innovation Network," PLOS ONE, Public Library of Science, vol. 11(1), pages 1-18, January.

    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:2:d:10.1007_s10589-023-00498-9. 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.