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

In a recent paper (Cartis et al. in Math Prog A 144(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 f...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical programming 2017, Vol.161 (1-2), p.611-626
Main Authors: Cartis, C., Gould, N. I. M., Toint, Ph. L.
Format: Article
Language:English
Subjects:
Algorithms
Calculus of Variations and Optimal Control
Optimization
Combinatorics
Lagrange multiplier
Mathematical analysis
Mathematical and Computational Physics
Mathematical Methods in Physics
Mathematics
Mathematics and Statistics
Mathematics of Computing
Nonlinear programming
Numerical Analysis
Optimization
Optimization algorithms
Short Communication
Studies
Theoretical
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In a recent paper (Cartis et al. in Math Prog A 144(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.
ISSN:0025-5610
1436-4646
DOI:10.1007/s10107-016-1016-4