On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization

By Coralia Cartis, N. Gould, Philippe L. Toint. 2012

73 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Mechanics, Numerical Analysis

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Luís Nunes Vicente
2. Rohollah Garmanjani

In Computational Mechanics

1. Rohollah Garmanjani
2. Luís Nunes Vicente
3. Xiaojun Chen

In Numerical Analysis

1. Rohollah Garmanjani
2. Luís Nunes Vicente
3. Xiaojun Chen

Citations in the corpus

• Worst case complexity of direct search (2013, result): “Finally, we would like to mention that the result of our paper has been recently compared in Cartis, Gould, and Toint [5].”
• Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization (2013, methodology): “It has been proved by Cartis, Gould, and Toint [7] that the worst case bound O(ǫ −2 ) for steepest descent is sharp or tight (see the details in [7]).”