Research output per year
Research output per year
Search 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
-
2021
High-Order Evaluation Complexity for Convexly-Constrained Optimization with Non-Lipschitzian Group Sparsity Terms
Chen, X. & Toint, P., May 2021, In: Mathematical Programming. 187, 1-2, p. 47-78 32 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile49 Downloads (Pure) -
2020
A concise second-order complexity analysis for unconstrained optimization using high-order regularized models
Cartis, C., Gould, N. I. M. & Toint, P. L., 3 Mar 2020, In: Optimization Methods and Software. 35, 2, p. 243-256 14 p.Research output: Contribution to journal › Article › peer-review
-
A stochastic cubic regularisation method with inexact function evaluations and random derivatives for finite sum minimisation
Bellavia, S., Gurioli, G., Morini, B. & Toint, P. L., 2020, (Accepted/In press).Research output: Contribution to conference › Paper › peer-review
Open AccessFile71 Downloads (Pure) -
Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions
Cartis, C., Gould, N. & Toint, P., 30 Jan 2020, Arxiv.Research output: Working paper
File39 Downloads (Pure) -
2019
Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization
Cartis, C., Gould, N. I. M. & Toint, P., 10 Aug 2019, In: Journal of Complexity. 53, p. 68-94 32 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile46 Downloads (Pure)