On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization

An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity

(2012) C. Cartis et al.   IMA JOURNAL OF NUMERICAL ANALYSIS

On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization

(2012) Coralia Cartis et al.   SIAM JOURNAL ON OPTIMIZATION

Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization

(2011) Coralia Cartis et al.   OPTIMIZATION METHODS & SOFTWARE

On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming

(2011) Coralia Cartis et al.   SIAM JOURNAL ON OPTIMIZATION

Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity

(2010) Coralia Cartis et al.   MATHEMATICAL PROGRAMMING

Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares

(2010) S. Bellavia et al.   SIAM JOURNAL ON NUMERICAL ANALYSIS

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems

(2010) C. Cartis et al.   SIAM JOURNAL ON OPTIMIZATION

Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results

(2009) Coralia Cartis et al.   MATHEMATICAL PROGRAMMING

Nonlinear programming without a penalty function or a filter

(2008) N. I. M. Gould et al.   MATHEMATICAL PROGRAMMING