On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization

Coralia Cartis, N.I.M. Gould, Philippe Toint

Research output: Contribution to journal › Article › peer-review

44 Downloads (Pure)

34 Citations
6 Article
3 Working paper
1 Book

10 results

2022

Evaluation complexity of algorithms for nonconvex optimization
Cartis, C., Gould, N. I. M. & TOINT, P., Jul 2022, SIAM. 600 p. (SIAM-MOS Series on Optimization)
Research output: Book/Report/Journal › Book
2020
Adaptive regularization algorithms with inexact evaluations for nonconvex optimization
Bellavia, S., Gurioli, G., Morini, B. & Toint, P., 2 Jan 2020, In: SIAM Journal on Optimization. 29, 4, p. 2881-2915 35 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
37 Downloads (Pure)
An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
Gratton, S., Simon, E. & Toint, P., 21 Jan 2020, In: Mathematical Programming. 187, 1-2, p. 1-24 19 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
52 Downloads (Pure)
2018
Second-order optimality and beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization
Cartis, C., Gould, N. I. M. & Toint, P., 1 Oct 2018, In: Foundations of Computational Mathematics. 18, 5, p. 1073-1107 35 p.
Research output: Contribution to journal › Article › peer-review
2017
BFO, a trainable derivative-free Brute Force Optimizer for nonlinear bound-constrained optimization and equilibrium computations with continuous and discrete variables
Porcelli, M. & Toint, P., 30 Jun 2017, In: Transactions of the American Methematical Society on Mathematical Software. 44, 1, 28 p., 6.
Research output: Contribution to journal › Article › peer-review

File
47 Downloads (Pure)
Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
Toint, P., 2 Nov 2017, In: Optimization Methods and Software. 32, 6, p. 1273-1298 26 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
15 Downloads (Pure)
2016
Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models
Birgin, E., Gardenghi, J., Martinez, J-M., Santos, S. & Toint, P., 2016, In: SIAM Journal on Optimization. 26, 2, 20 p.
Research output: Contribution to journal › Article › peer-review

File
31 Downloads (Pure)
2015
Improved worst-case evaluation complexity for potentially rank-deficient nonlinear least-Euclidean-norm problems using higher-order regularized models
Cartis, C., Gould, N. I. M. & Toint, P., 18 Nov 2015, 18 p. (naXys technical report).
Research output: Working paper

File
45 Downloads (Pure)
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
Birgin, E., Gardenghi, J., Martinez, J-M., Santos, S. A. & Toint, P., Jun 2015, 2015: Namur center for complex systems, 8 p. (naXys Technical Reports; vol. 05-2015).
Research output: Working paper

File
51 Downloads (Pure)
2013
An example of slow convergence for Newton's method on a function with globally Lipschitz continuous Hessian
Cartis, C., Gould, N. I. M. & Toint, P., 5 May 2013, Namur center for complex systems, 9 p.
Research output: Working paper

File
98 Downloads (Pure)

On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization

Research output

Search results