Nonlinear programming without a penalty function or a filter av Gould, N, Toint, P

On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming. av Cartis, C, Gould, N, Toint, P

A concise second-order complexity analysis for unconstrained optimization using high-order regularized models av Cartis, C, Gould, N, Toint, P

Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models av Cartis, C, Gould, N, Toint, P

Complexity bounds for second-order optimality in unconstrained optimization. av Cartis, C, Gould, N, Toint, P

On the complexity of finding first-order critical points in constrained nonlinear optimization av Cartis, C, Gould, N, Toint, P

Trust-region and other regularisations of linear least-squares problems av Cartis, C, Gould, N, Toint, P

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems. av Cartis, C, Gould, N, Toint, P

Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. av Cartis, C, Gould, N, Toint, P

Second-order optimality and beyond: characterization and evaluation complexity in convexly-constrained nonlinear optimization av Cartis, C, Gould, N, Toint, P

Adaptive cubic overestimation methods for unconstrained optimization av Cartis, C, Gould, N, Toint, P

On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization av Cartis, C, Gould, N, Toint, P

Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization av Cartis, C, Gould, N, Toint, P

Adaptive cubic overestimation methods for unconstrained optimization av Cartis, C, Gould, N, Toint, P

On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization. av Cartis, C, Gould, N, Toint, P

Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. av Cartis, C, Gould, N, Toint, P

An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity av Cartis, C, Gould, N, Toint, P

Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization. av Cartis, C, Gould, N, Toint, P

Trust-region and other regularisations of linear least-squares problems av Cartis, C, Gould, N, Toint, P

A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function. av Cartis, C, Gould, N, Toint, P