Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization

DOI10.1007/s10107-016-1016-4zbMath1472.68066OpenAlexW2189341307WikidataQ58185644 ScholiaQ58185644MaRDI QIDQ507344

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

zbMATH Keywords

worst-case analysisconstrained nonlinear optimizationevaluation complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30)

Related Items (7)

Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization ⋮ A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms ⋮ Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization ⋮ Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained 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 ⋮ Provably training overparameterized neural network classifiers with non-convex constraints

Cites Work

• Unnamed Item
• 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
• 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
• Conditions for convergence of trust region algorithms for nonsmooth optimization
• Trust Region Methods

This page was built for publication: Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization