On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization (Q2902870): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: ve08 / rank | |||
Normal rank |
Revision as of 06:46, 29 February 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