Optimization Online


Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization

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

Abstract: In a recent paper (Cartis, Gould and Toint, Math. Prog. A 144(1-2) 93--106, 2014), the evaluation complexity of an algorithm to find an approximate first-order critical point for the general smooth constrained optimization problem was examined. Unfortunately, the proof of Lemma 3.5 in that paper uses a result from an earlier paper in an incorrect way, and indeed the result of the lemma is false. The purpose of this corrigendum is to provide a modification of the previous analysis that allows us to restore the complexity bound for a different, scaled measure of first-order criticality.

Keywords: evaluation complexity, worst-case analysis, constrained nonlinear optimization

Category 1: Nonlinear Optimization (Constrained Nonlinear Optimization )

Citation: Preprint, Rutherford Appleton, Laboratory, Chilton, Oxfordshire, England

Download: [PDF]

Entry Submitted: 11/28/2014
Entry Accepted: 11/28/2014
Entry Last Modified: 11/28/2014

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