Convex optimization techniques due to Nestrov and computational complexity (Q4898650)
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: Convex optimization techniques due to Nestrov and computational complexity |
scientific article; zbMATH DE number 6120758
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex optimization techniques due to Nestrov and computational complexity |
scientific article; zbMATH DE number 6120758 |
Statements
2 January 2013
0 references
robustness
0 references
duality and bounds
0 references
convergence and property of solution
0 references
Nesterov's method
0 references
0.7179781198501587
0 references
0.7164081335067749
0 references
0.7130700349807739
0 references
0.6947557926177979
0 references
0.694603443145752
0 references
