IDEAS home Printed from https://ideas.repec.org/p/hal/wpaper/hal-05551606.html

Convergence Rates for the Alternating Minimization Algorithm in Structured Nonsmooth and Nonconvex Optimization

Author

Listed:
  • Glaydston C. Bento

    (UFG - Federal University of Goiás)

  • Boris S. Mordukhovich

    (Wayne State University [Detroit])

  • Tiago S. Mota

    (UFG - Federal University of Goiás)

  • Antoine Soubeyran

    (AMSE - Aix-Marseille Sciences Economiques - EHESS - École des hautes études en sciences sociales - AMU - Aix Marseille Université - ECM - École Centrale de Marseille - CNRS - Centre National de la Recherche Scientifique)

Abstract

This paper is devoted to developing the alternating minimization algorithm for problems of structured nonconvex optimization proposed by Attouch, Bolt´e, Redont, and Soubeyran in 2010. Our main result provides significant improvements of the convergence rate of the algorithm, especially under the low exponent PolyakLojasiewicz-Kurdyka condition when we establish either finite termination of this algorithm or its superlinear convergence rate instead of the previously known linear convergence. We also investigate the PLK exponent calculus and discuss applications to noncooperative games and behavioralscience.

Suggested Citation

  • Glaydston C. Bento & Boris S. Mordukhovich & Tiago S. Mota & Antoine Soubeyran, 2026. "Convergence Rates for the Alternating Minimization Algorithm in Structured Nonsmooth and Nonconvex Optimization," Working Papers hal-05551606, HAL.
    • Handle: RePEc:hal:wpaper:hal-05551606
    Note: View the original document on HAL open archive server: https://hal.science/hal-05551606v1
    as

    Download full text from publisher

    File URL: https://hal.science/hal-05551606v1/document
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:hal:wpaper:hal-05551606. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.