Two-timescale gradient descent ascent algorithms for nonconvex minimax optimization (Q6982689)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 8041960
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-timescale gradient descent ascent algorithms for nonconvex minimax optimization |
scientific article; zbMATH DE number 8041960 |
Statements
Two-timescale gradient descent ascent algorithms for nonconvex minimax optimization (English)
0 references
16 May 2025
0 references
The authors introduce and investigate two-timescale gradient descent ascent type algorithms for solving structured minimax problems, where nonconvexity in the first variable and concavity in the second variable are imposed (the underlying set is convex and bounded). Theoretical bounds on the complexity for solving smooth and nonsmooth problems are derived as well.
0 references
structured nonconvex minimax optimization
0 references
two-timescale gradient descent ascent
0 references
iteration complexity analysis
0 references
