On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization

Coralia Cartis, N.I.M. Gould, Philippe Toint

Research output: Contribution to journalArticle

65 Downloads (Pure)

Abstract

The (optimal) function/gradient evaluations worst-case complexity analysis available for the adaptive regularization algorithms with cubics (ARC) for nonconvex smooth unconstrained optimization is extended to finite-difference versions of this algorithm, yielding complexity bounds for first-order and derivative-free methods applied on the same problem class. A comparison with the results obtained for derivative-free methods by Vicente [Worst Case Complexity of Direct Search, Technical report, Preprint 10-17, Department of Mathematics, University of Coimbra, Coimbra, Portugal, 2010] is also discussed, giving some theoretical insight into the relative merits of various methods in this popular class of algorithms. © 2012 Society for Industrial and Applied Mathematics.
Original languageEnglish
Pages (from-to)66-86
Number of pages21
JournalSIAM Journal on Optimization
Volume22
Issue number1
DOIs
Publication statusPublished - 1 Jan 2012

Keywords

  • nonconvex optimization.
  • finite-differences
  • oracle complexity
  • first-order methods
  • worst-case analysis
  • derivative free optimization

Fingerprint Dive into the research topics of 'On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization'. Together they form a unique fingerprint.

  • Projects

    Complexity in nonlinear optimization

    TOINT, P., Gould, N. I. M. & Cartis, C.

    1/11/08 → …

    Project: Research

    Activities

    • 3 Oral presentation
    • 1 Research/Teaching in a external institution
    • 1 Visiting an external academic institution

    How much patience do you have? Issues in complexity for nonlinear optimization

    Philippe Toint (Invited speaker)

    5 Feb 2016

    Activity: Talk or presentation typesOral presentation

    Polytechnic University of Hong Kong

    Philippe Toint (Visiting researcher)

    31 Jan 201614 Feb 2016

    Activity: Visiting an external institution typesResearch/Teaching in a external institution

    How much patience do you have? Issues in complexity for nonlinear optimization

    Philippe Toint (Speaker)

    31 Jan 2016

    Activity: Talk or presentation typesOral presentation

    Cite this