On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization (Q2902870)
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: On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization |
scientific article; zbMATH DE number 6070008
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization |
scientific article; zbMATH DE number 6070008 |
Statements
22 August 2012
0 references
oracle complexity
0 references
worst-case analysis
0 references
finite differences
0 references
first-order methods
0 references
derivative-free optimization
0 references
nonconvex optimization
0 references
0.9249872
0 references
0.9200127
0 references
0.9154563
0 references
0.8909186
0 references
0.8868623
0 references
0.8813504
0 references
0.88062453
0 references
0.88042086
0 references
0.8778578
0 references
On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization (English)
0 references
