Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization
DOI10.1007/S10107-016-1016-4zbMATH Open1472.68066OpenAlexW2189341307WikidataQ58185644 ScholiaQ58185644MaRDI QIDQ507344FDOQ507344
Authors: Yong-Cai Geng, Sumit K. Garg 
Publication date: 3 February 2017
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-016-1016-4
Recommendations
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- Corrigendum
- Corrigendum to: ``Critical cones for sufficient second order conditions in PDE constrained optimization
- Erratum to: ``A regularized Newton method without line search for unconstrained optimization
- Corrigendum to ``Optimality conditions using approximations for nonsmooth vector optimization problems under general inequality constraints
Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- Trust Region Methods
- On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
- On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
Cited In (9)
- Provably training overparameterized neural network classifiers with non-convex constraints
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
- Corrigendum to: ``Critical cones for sufficient second order conditions in PDE constrained optimization
- A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
- Ghost penalties in nonconvex constrained optimization: diminishing stepsizes and iteration complexity
- Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization
- Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization
This page was built for publication: Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507344)
