Showing 1 - 20 results of 25 for search 'Toint, P', query time: 0.03s
Refine Results
-
1
Nonlinear programming without a penalty function or a filter by Gould, N, Toint, P
Published 2007Report -
2
On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming. by Cartis, C, Gould, N, Toint, P
Published 2011Journal article -
3
A concise second-order complexity analysis for unconstrained optimization using high-order regularized models by Cartis, C, Gould, N, Toint, P
Published 2019Journal article -
4
Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models by Cartis, C, Gould, N, Toint, P
Published 2019Conference item -
5
Complexity bounds for second-order optimality in unconstrained optimization. by Cartis, C, Gould, N, Toint, P
Published 2012Journal article -
6
On the complexity of finding first-order critical points in constrained nonlinear optimization by Cartis, C, Gould, N, Toint, P
Published 2012Journal article -
7
Trust-region and other regularisations of linear least-squares problems by Cartis, C, Gould, N, Toint, P
Published 2008Report -
8
On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems. by Cartis, C, Gould, N, Toint, P
Published 2010Journal article -
9
-
10
Second-order optimality and beyond: characterization and evaluation complexity in convexly-constrained nonlinear optimization by Cartis, C, Gould, N, Toint, P
Published 2017Journal article -
11
Adaptive cubic overestimation methods for unconstrained optimization by Cartis, C, Gould, N, Toint, P
Published 2007Report -
12
-
13
Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization by Cartis, C, Gould, N, Toint, P
Published 2016Journal article -
14
Adaptive cubic overestimation methods for unconstrained optimization by Cartis, C, Gould, N, Toint, P
Published 2007Report -
15
On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization. by Cartis, C, Gould, N, Toint, P
Published 2012Journal article -
16
Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. by Cartis, C, Gould, N, Toint, P
Published 2011Journal article -
17
-
18
Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization. by Cartis, C, Gould, N, Toint, P
Published 2012Journal article -
19
Trust-region and other regularisations of linear least-squares problems by Cartis, C, Gould, N, Toint, P
Published 2009Journal article -
20
A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function. by Cartis, C, Gould, N, Toint, P
Published 2013Journal article