IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v206y2025i2d10.1007_s10957-025-02733-1.html
   My bibliography  Save this article

Proximal-Type Algorithms for Solving Nonconvex Mixed Multivalued Quasi-Variational Inequality Problems

Author

Listed:
  • S.-M. Grad

    (Unité de Mathématiques Appliquées)

  • L. D. Muu

    (TIMAS, Thang Long University and Institute of Mathematics, VAST)

  • T. V. Thang

    (Electric Power University)

Abstract

We propose iterative algorithms of proximal point type for solving two classes of mixed multivalued quasi-variational inequality problems in real Euclidean spaces involving nonconvex functions, for which no similar algorithms are currently known. Our proposed algorithms combine the proximal type algorithm for solving mixed variational inequalities in a nonconvex framework, the Mann iteration scheme for approximating a fixed point of certain generalized nonexpansive multivalued mappings with the infeasible projection and cutting plane techniques for variational inequalities to generate iterative sequences that converge to a solution of a mixed multivalued quasi-variational inequality problem under mild assumptions. An application to generalized Nash (quasi)equilibrium problems is discussed. Numerical experiments confirm the usability of the introduced algorithms.

Suggested Citation

  • S.-M. Grad & L. D. Muu & T. V. Thang, 2025. "Proximal-Type Algorithms for Solving Nonconvex Mixed Multivalued Quasi-Variational Inequality Problems," Journal of Optimization Theory and Applications, Springer, vol. 206(2), pages 1-26, August.
    • Handle: RePEc:spr:joptap:v:206:y:2025:i:2:d:10.1007_s10957-025-02733-1
    DOI: 10.1007/s10957-025-02733-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-025-02733-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/s10957-025-02733-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.

    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:joptap:v:206:y:2025:i:2:d:10.1007_s10957-025-02733-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.

    We have no bibliographic references for this item. You can help adding them by using 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.