A stochastic implicit proximal point algorithm is introduced for linearly constrained stochastic minimax problems, claiming linear convergence rates and better performance on ML tasks.
1765– 1773
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Stochastic Implicit Proximal Point Algorithm for Solving Linearly Constrained Stochastic Minimax Problems
A stochastic implicit proximal point algorithm is introduced for linearly constrained stochastic minimax problems, claiming linear convergence rates and better performance on ML tasks.