2021
DOI: 10.48550/arxiv.2104.06206
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…Note that OGDA is most commonly written in the form where β = 1 is used, see [6,17,43], with the exception of two recent works which have investigated a more general coefficient see [45,55]. However, there, and for related methods [11,28,31], the parameter β is usually restricted to be less than 1. Only [55] allows for values larger than 1 and in their main theorem they actually use the same choice as we, namely β = 2.…”
Section: Introductionmentioning
confidence: 99%
“…Note that OGDA is most commonly written in the form where β = 1 is used, see [6,17,43], with the exception of two recent works which have investigated a more general coefficient see [45,55]. However, there, and for related methods [11,28,31], the parameter β is usually restricted to be less than 1. Only [55] allows for values larger than 1 and in their main theorem they actually use the same choice as we, namely β = 2.…”
Section: Introductionmentioning
confidence: 99%