EconPapers    
Economics at your fingertips  
 

An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems

Huiling Zhang and Zi Xu ()
Additional contact information
Huiling Zhang: Shanghai University
Zi Xu: Shanghai University

Computational Optimization and Applications, 2025, vol. 90, issue 2, No 8, 557-582

Abstract: Abstract Stochastic nonconvex minimax problems have attracted wide attention in machine learning, signal processing and many other fields in recent years. In this paper, we propose an accelerated first-order regularized momentum descent ascent algorithm (FORMDA) for solving stochastic nonconvex-concave minimax problems. The iteration complexity of the algorithm is proved to be $$\tilde{\mathcal {O}}(\varepsilon ^{-6.5})$$ O ~ ( ε - 6.5 ) to obtain an $$\varepsilon $$ ε -stationary point, which achieves the best-known complexity bound for single-loop algorithms to solve the stochastic nonconvex-concave minimax problems under the stationarity of the objective function.

Keywords: Stochastic nonconvex minimax problem; Accelerated momentum projection gradient algorithm; Iteration complexity; Machine learning (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-024-00638-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:coopap:v:90:y:2025:i:2:d:10.1007_s10589-024-00638-9

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-024-00638-9

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:coopap:v:90:y:2025:i:2:d:10.1007_s10589-024-00638-9