On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization (Q2902870): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q58185697, #quickstatements; #temporary_batch_1705751991639 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q58185697 / rank | |||
Normal rank | |||
Revision as of 13:11, 20 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization |
scientific article |
Statements
On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization (English)
0 references
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
