📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

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

First Author: Cartis C

Attributed to: Algorithms and Software for Large-Scale Sparse or Structured Systems funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1137/100812276

Publication URI: http://dx.doi.org/10.1137/100812276

Type: Journal Article/Review

Parent Publication: SIAM Journal on Optimization

Issue: 1