Dual subgradient algorithms for large-scale nonsmooth learning problems (Q484132)
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: Dual subgradient algorithms for large-scale nonsmooth learning problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dual subgradient algorithms for large-scale nonsmooth learning problems |
scientific article |
Statements
Dual subgradient algorithms for large-scale nonsmooth learning problems (English)
0 references
18 December 2014
0 references
dual subgradient algorithms
0 references
large-scale nonsmooth learning problems
0 references
numerical examples
0 references
first-order algorithms
0 references
convex optimization
0 references
mirror descent algorithm
0 references
Nesterov's optimal algorithm
0 references
matrix completion
0 references
0 references
0.7868569493293762
0 references
0.7792211174964905
0 references
0.7666758298873901
0 references
0.7546287775039673
0 references
0.7516435980796814
0 references
