Research output per year
Research output per year
Search results
-
2015
Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
Cartis, C., Fowkes, J. M. & Gould, N. I. M., Mar 2015, In: Journal of Global Optimization. 61, 3, p. 429-457 29 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
2014
On the complexity of finding first-order critical points in constrained nonlinear optimization
Cartis, C., Gould, N. & Toint, P., Apr 2014, In: Mathematical programming. 144, 1-2, p. 93-106 14 p.Research output: Contribution to journal › Article › peer-review
-
Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
Cartis, C., Sampaio, P. R. & Toint, P. L., 1 Jan 2014, In: Optimization.Research output: Contribution to journal › Article › peer-review
-
2013
A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function
Cartis, C., Gould, N. I. M. & Toint, P. L., 1 Jun 2013, In: Optimization Methods & Software. 28, 3, p. 451-457 7 p.Research output: Contribution to journal › Article › peer-review
-
ON THE EVALUATION COMPLEXITY OF CUBIC REGULARIZATION METHODS FOR POTENTIALLY RANK-DEFICIENT NONLINEAR LEAST-SQUARES PROBLEMS AND ITS RELEVANCE TO CONSTRAINED NONLINEAR OPTIMIZATION
Cartis, C., Gould, N. I. M. & Toint, P. L., 2013, In: Siam journal on optimization. 23, 3, p. 1553-1574 22 p.Research output: Contribution to journal › Article › peer-review