On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods

DOI10.1137/130915546zbMath1329.65124OpenAlexW2018738327WikidataQ58185651 ScholiaQ58185651MaRDI QIDQ5253577

Nicholas I. M. Gould, Coralia Cartis, Phillipe L. Toint

Publication date: 27 May 2015

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/49cb76ba1395176268baa5f6c34b27e5037ad20e

zbMATH Keywords

worst-case analysisconstrained nonlinear optimizationevaluation complexityleast-squares problemscubic regularization methods

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items

Structured adaptive spectral-based algorithms for nonlinear least squares problems with robotic arm modelling applications, A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees, A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization, A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization, A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares, Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization, Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization, A brief survey of methods for solving nonlinear least-squares problems, Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization, Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary, Recent advances in trust region algorithms

Cites Work

• Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
• Complexity bounds for second-order optimality in unconstrained optimization
• Introductory lectures on convex optimization. A basic course.
• On the complexity of finding first-order critical points in constrained nonlinear optimization
• Cubic regularization of Newton method and its global performance
• 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
• Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
• Conditions for convergence of trust region algorithms for nonsmooth optimization
• An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
• Black-Box Complexity of Local Minimization
• Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints