Non-Euclidean restricted memory level method for large-scale convex optimization (Q1774171)
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: Non-Euclidean restricted memory level method for large-scale convex optimization |
scientific article; zbMATH DE number 2162529
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-Euclidean restricted memory level method for large-scale convex optimization |
scientific article; zbMATH DE number 2162529 |
Statements
Non-Euclidean restricted memory level method for large-scale convex optimization (English)
0 references
29 April 2005
0 references
subgradient-type method
0 references
large-scale nonsmooth convex functions over simple domains
0 references
non-Lipschitzian convex objectives
0 references
saddle point
0 references
variational inequalities
0 references
0.8028854727745056
0 references
0.7734098434448242
0 references
0.7717383503913879
0 references
0.7629250288009644
0 references
0.7605305910110474
0 references
