Solving large-scale minimax problems with the primal-dual steepest descent algorithm (Q1340066)
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: Solving large-scale minimax problems with the primal-dual steepest descent algorithm |
scientific article; zbMATH DE number 700813
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving large-scale minimax problems with the primal-dual steepest descent algorithm |
scientific article; zbMATH DE number 700813 |
Statements
Solving large-scale minimax problems with the primal-dual steepest descent algorithm (English)
0 references
9 February 1995
0 references
primal-dual projected gradient algorithm
0 references
primal-dual steepest descent algorithm
0 references
constrained minimax problems
0 references
asymptotic rates of convergence
0 references
saddle function
0 references
extended linear-quadratic programming
0 references
0 references
0 references
0 references
0.7975119352340698
0 references
0.791555643081665
0 references
0.7910389304161072
0 references
0.7821443676948547
0 references
