On the complexity of finding first-order critical points in constrained nonlinear optimization (vol 144, pg 93, 2014)
成果类型：
Correction
署名作者：
Cartis, C.; Gould, N. I. M.; Toint, Ph. L.
署名单位：
University of Oxford; UK Research & Innovation (UKRI); Science & Technology Facilities Council (STFC); STFC Rutherford Appleton Laboratory; University of Namur; University of Namur
刊物名称：
MATHEMATICAL PROGRAMMING
ISSN/ISSBN：
0025-5610
DOI：
10.1007/s10107-016-1016-4
发表日期：
2017
页码：
611-626
关键词：
摘要：
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.
来源URL：