IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v77y2020i2d10.1007_s10589-020-00210-1.html
   My bibliography  Save this article

An explicit Tikhonov algorithm for nested variational inequalities

Author

Listed:
  • Lorenzo Lampariello

    (Roma Tre University)

  • Christoph Neumann

    (Karlsruhe Institute of Technology (KIT))

  • Jacopo M. Ricci

    (Roma Tre University)

  • Simone Sagratella

    (Sapienza University of Rome)

  • Oliver Stein

    (Karlsruhe Institute of Technology (KIT))

Abstract

We consider nested variational inequalities consisting in a (upper-level) variational inequality whose feasible set is given by the solution set of another (lower-level) variational inequality. Purely hierarchical convex bilevel optimization problems and certain multi-follower games are particular instances of nested variational inequalities. We present an explicit and ready-to-implement Tikhonov-type solution method for such problems. We give conditions that guarantee the convergence of the proposed method. Moreover, inspired by recent works in the literature, we provide a convergence rate analysis. In particular, for the simple bilevel instance, we are able to obtain enhanced convergence results.

Suggested Citation

  • Lorenzo Lampariello & Christoph Neumann & Jacopo M. Ricci & Simone Sagratella & Oliver Stein, 2020. "An explicit Tikhonov algorithm for nested variational inequalities," Computational Optimization and Applications, Springer, vol. 77(2), pages 335-350, November.
    • Handle: RePEc:spr:coopap:v:77:y:2020:i:2:d:10.1007_s10589-020-00210-1
    DOI: 10.1007/s10589-020-00210-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-020-00210-1
    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-020-00210-1?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. Francisco Facchinei & Lorenzo Lampariello, 2011. "Partial penalization for the solution of generalized Nash equilibrium problems," Journal of Global Optimization, Springer, vol. 50(1), pages 39-57, May.
    2. Lorenzo Lampariello & Simone Sagratella, 2020. "Numerically tractable optimistic bilevel problems," Computational Optimization and Applications, Springer, vol. 76(2), pages 277-303, June.
    3. Simone Sagratella, 2017. "Algorithms for generalized potential games with mixed-integer variables," Computational Optimization and Applications, Springer, vol. 68(3), pages 689-717, December.
    4. Lorenzo Lampariello & Simone Sagratella, 2017. "A Bridge Between Bilevel Programs and Nash Games," Journal of Optimization Theory and Applications, Springer, vol. 174(2), pages 613-635, August.
    5. Francisco Facchinei & Christian Kanzow & Sebastian Karl & Simone Sagratella, 2015. "The semismooth Newton method for the solution of quasi-variational inequalities," Computational Optimization and Applications, Springer, vol. 62(1), pages 85-109, September.
    6. Simone Sagratella, 2017. "Computing equilibria of Cournot oligopoly models with mixed-integer quantities," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(3), pages 549-565, December.
    7. Didier Aussel & Simone Sagratella, 2017. "Sufficient conditions to compute any solution of a quasivariational inequality via a variational inequality," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 85(1), pages 3-18, February.
    8. Giuseppe Marino & Hong-Kun Xu, 2011. "Explicit Hierarchical Fixed Point Approach to Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 149(1), pages 61-78, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lampariello, Lorenzo & Neumann, Christoph & Ricci, Jacopo M. & Sagratella, Simone & Stein, Oliver, 2021. "Equilibrium selection for multi-portfolio optimization," European Journal of Operational Research, Elsevier, vol. 295(1), pages 363-373.
    2. Lorenzo Lampariello & Gianluca Priori & Simone Sagratella, 2022. "On the solution of monotone nested variational inequalities," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 96(3), pages 421-446, December.
    3. Giancarlo Bigi & Lorenzo Lampariello & Simone Sagratella & Valerio Giuseppe Sasso, 2023. "Approximate variational inequalities and equilibria," Computational Management Science, Springer, vol. 20(1), pages 1-16, December.

    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. Lampariello, Lorenzo & Neumann, Christoph & Ricci, Jacopo M. & Sagratella, Simone & Stein, Oliver, 2021. "Equilibrium selection for multi-portfolio optimization," European Journal of Operational Research, Elsevier, vol. 295(1), pages 363-373.
    2. Francesco Cesarone & Lorenzo Lampariello & Davide Merolla & Jacopo Maria Ricci & Simone Sagratella & Valerio Giuseppe Sasso, 2023. "A bilevel approach to ESG multi-portfolio selection," Computational Management Science, Springer, vol. 20(1), pages 1-23, December.
    3. Lorenzo Lampariello & Simone Sagratella, 2020. "Numerically tractable optimistic bilevel problems," Computational Optimization and Applications, Springer, vol. 76(2), pages 277-303, June.
    4. 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.
    5. Cesarone, Francesco & Lampariello, Lorenzo & Sagratella, Simone, 2019. "A risk-gain dominance maximization approach to enhanced index tracking," Finance Research Letters, Elsevier, vol. 29(C), pages 231-238.
    6. Simone Sagratella, 2017. "Algorithms for generalized potential games with mixed-integer variables," Computational Optimization and Applications, Springer, vol. 68(3), pages 689-717, December.
    7. Giancarlo Bigi & Lorenzo Lampariello & Simone Sagratella & Valerio Giuseppe Sasso, 2023. "Approximate variational inequalities and equilibria," Computational Management Science, Springer, vol. 20(1), pages 1-16, December.
    8. Tommaso Colombo & Simone Sagratella, 2020. "Distributed algorithms for convex problems with linear coupling constraints," Journal of Global Optimization, Springer, vol. 77(1), pages 53-73, May.
    9. Lorenzo Lampariello & Gianluca Priori & Simone Sagratella, 2022. "On the solution of monotone nested variational inequalities," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 96(3), pages 421-446, December.
    10. Axel Dreves & Simone Sagratella, 2020. "Nonsingularity and Stationarity Results for Quasi-Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 185(3), pages 711-743, June.
    11. Sagratella, Simone & Schmidt, Marcel & Sudermann-Merx, Nathan, 2020. "The noncooperative fixed charge transportation problem," European Journal of Operational Research, Elsevier, vol. 284(1), pages 373-382.
    12. Christian Kanzow & Daniel Steck, 2018. "Augmented Lagrangian and exact penalty methods for quasi-variational inequalities," Computational Optimization and Applications, Springer, vol. 69(3), pages 801-824, April.
    13. Rahman Khorramfar & Osman Ozaltin & Reha Uzsoy & Karl Kempf, 2024. "Coordinating Resource Allocation during Product Transitions Using a Multifollower Bilevel Programming Model," Papers 2401.17402, arXiv.org.
    14. Alain B. Zemkoho & Shenglong Zhou, 2021. "Theoretical and numerical comparison of the Karush–Kuhn–Tucker and value function reformulations in bilevel optimization," Computational Optimization and Applications, Springer, vol. 78(2), pages 625-674, March.
    15. Pin-Bo Chen & Gui-Hua Lin & Xide Zhu & Fusheng Bai, 2021. "Smoothing Newton method for nonsmooth second-order cone complementarity problems with application to electric power markets," Journal of Global Optimization, Springer, vol. 80(3), pages 635-659, July.
    16. Simone Sagratella, 2017. "Computing equilibria of Cournot oligopoly models with mixed-integer quantities," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(3), pages 549-565, December.
    17. Lorenzo Lampariello & Simone Sagratella, 2017. "A Bridge Between Bilevel Programs and Nash Games," Journal of Optimization Theory and Applications, Springer, vol. 174(2), pages 613-635, August.
    18. Yekini Shehu & Aviv Gibali & Simone Sagratella, 2020. "Inertial Projection-Type Methods for Solving Quasi-Variational Inequalities in Real Hilbert Spaces," Journal of Optimization Theory and Applications, Springer, vol. 184(3), pages 877-894, March.
    19. Rahman Khorramfar & Osman Y. Özaltın & Karl G. Kempf & Reha Uzsoy, 2022. "Managing Product Transitions: A Bilevel Programming Approach," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2828-2844, September.
    20. Lorenzo Lampariello & Simone Sagratella, 2015. "It is a matter of hierarchy: a Nash equilibrium problem perspective on bilevel programming," DIAG Technical Reports 2015-07, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".

    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:77:y:2020:i:2:d:10.1007_s10589-020-00210-1. 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.