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 fr...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
Springer
2016
|