Stochastic approximation algorithm for minimax problems (Q1823151)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1823151 |
scientific article; zbMATH DE number 4114389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stochastic approximation algorithm for minimax problems |
scientific article; zbMATH DE number 4114389 |
Statements
Stochastic approximation algorithm for minimax problems (English)
0 references
1990
0 references
A stochastic approximation algorithm for minimax optimization problems is analyzed. At each iterate, it performs one random experiment, based on which it computes a direction vector. It is shown that, under suitable conditions, it a.s. converges to the set of points satisfying necessary optimality conditions. The algorithm and its analysis bring together ideas from stochastic approximation and nondifferentiable optimization.
0 references
stochastic approximation
0 references
minimax optimization
0 references
nondifferentiable optimization
0 references
0 references
0 references
0.8380982875823975
0 references
0.8197511434555054
0 references
0.8180551528930664
0 references
0.8180551528930664
0 references
0.8157450556755066
0 references
