Mirror descent and nonlinear projected subgradient methods for convex optimization. (Q1811622)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1929380
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mirror descent and nonlinear projected subgradient methods for convex optimization. |
scientific article; zbMATH DE number 1929380 |
Statements
Mirror descent and nonlinear projected subgradient methods for convex optimization. (English)
0 references
17 June 2003
0 references
Nonsmooth convex minimization
0 references
Projected subgradient methods
0 references
Nonlinear
0 references
projections
0 references
Mirror descent algorithms
0 references
Relative entropy
0 references
Complexity analysis
0 references
Global rate of
0 references
convergence
0 references
0 references
0.8312510848045349
0 references
0.8011153340339661
0 references
0.7938894033432007
0 references
0.7862298488616943
0 references
0.7853745222091675
0 references
