Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds (Q2363571)
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: Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds |
scientific article |
Statements
Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds (English)
0 references
20 July 2017
0 references
complexity
0 references
gradient method
0 references
subgradient method
0 references
proximal point method
0 references
Riemannian manifold
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8987503051757812
0 references
0.8814420104026794
0 references
0.8166710734367371
0 references
0.8160368800163269
0 references
0.810750424861908
0 references
