Journal article
Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization
- Abstract:
- 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.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 176.7KB, Terms of use)
-
- Publisher copy:
- 10.1007/s10107-016-1016-4
Authors
- Publisher:
- Springer
- Journal:
- Mathematical Programming More from this journal
- Volume:
- 161
- Issue:
- 1-2
- Pages:
- 611–626
- Publication date:
- 2016-03-04
- Acceptance date:
- 2016-03-31
- DOI:
- EISSN:
-
1436-4646
- ISSN:
-
0025-5610
- Keywords:
- Pubs id:
-
pubs:620857
- UUID:
-
uuid:4f165cda-d533-47e2-8d83-3f410c498622
- Local pid:
-
pubs:620857
- Source identifiers:
-
620857
- Deposit date:
-
2017-02-04
- ARK identifier:
Terms of use
- Copyright holder:
- ©Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society 2016
- Copyright date:
- 2016
- Notes:
- This is the author accepted manuscript following peer review version of the article. The final version is available online from Springer at: https://doi.org/10.1007/s10107-016-1016-4
If you are the owner of this record, you can report an update to it here: Report update to this record