On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. (Q1410305)
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: On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. |
scientific article; zbMATH DE number 1992597
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. |
scientific article; zbMATH DE number 1992597 |
Statements
On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. (English)
0 references
14 October 2003
0 references
Convex programming
0 references
Nonlinear programming
0 references
Game theory
0 references
Large-scale optimization
0 references
0 references
0 references
0 references
0 references
0.9453387
0 references
0.9234703
0 references
0.90019447
0 references
0.8998204
0 references
0.8996933
0 references
0.8983554
0 references
0.8965542
0 references
