Optimization Online


How much patience do you have? A worst-case perspective on smooth nonconvex optimization

Coralia Cartis(Coralia.Cartis***at***ed.ac.uk)
Nick Gould(nick.gould***at***stfc.ac.uk)
Philippe Toint(philippe.toint***at***fundp.ac.be)

Abstract: The paper presents a survey of recent results in the field of worst-case complexity of algorithms for nonlinear (and possibly nonconvex) smooth optimization. Both constrained and unconstrained case are considered.

Keywords: Worst-case, complexity, nonlinear optimization

Category 1: Nonlinear Optimization (Unconstrained Optimization )

Category 2: Nonlinear Optimization (Constrained Nonlinear Optimization )

Category 3: Nonlinear Optimization (Nonlinear Systems and Least-Squares )


Download: [PDF]

Entry Submitted: 09/09/2012
Entry Accepted: 09/09/2012
Entry Last Modified: 09/09/2012

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society