Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization
From MaRDI portal
(Redirected from Publication:507344)
Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization''
Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization''
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
Cites work
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- 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 evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
- Trust Region Methods
Cited in
(9)- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
- 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
- A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
- Ghost penalties in nonconvex constrained optimization: diminishing stepsizes and iteration complexity
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- 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
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)
