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

Glaydston C. Bento (), Boris S. Mordukhovich, Tiago S. Mota and Antoine Soubeyran
Additional contact information
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

Working Papers from HAL

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.

Keywords: Polyak- Lojasiewicz-Kurdyka conditions; convergence rates; noncooperative games; alternating minimization algorithm; nonsmooth optimization (search for similar items in EconPapers)
Date: 2026-01-30
Note: View the original document on HAL open archive server: https://hal.science/hal-05551606v1
References: Add references at CitEc
Citations:

Downloads: (external link)
https://hal.science/hal-05551606v1/document (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:wpaper:hal-05551606

Access Statistics for this paper

More papers in Working Papers from HAL
Bibliographic data for series maintained by CCSD ().