285 citations · 499 across the 55 of their papers we have counts for
5 papers · 1 filter
Strong Evaluation Complexity of An Inexact Trust-Region Algorithm for Arbitrary-Order Unconstrained Nonconvex Optimization
C. Cartis, N. I. M. Gould, Ph. L. Toint
A trust-region algorithm using inexact function and derivatives values is introduced for solving unconstrained smooth optimization problems. This algorithm uses high-order Taylor m…
Constrained global optimization of functions with low effective dimensionality using multiple random embeddings
Coralia Cartis, Estelle Massart, Adilet Otemissov
We consider the bound-constrained global optimization of functions with low effective dimensionality, that are constant along an (unknown) linear subspace and only vary over the ef…
Scalable Derivative-Free Optimization for Nonlinear Least-Squares Problems
Coralia Cartis, Tyler Ferguson, Lindon Roberts
Derivative-free - or zeroth-order - optimization (DFO) has gained recent attention for its ability to solve problems in a variety of application areas, including machine learning,…
A dimensionality reduction technique for unconstrained global optimization of functions with low effective dimensionality
Coralia Cartis, Adilet Otemissov
We investigate the unconstrained global optimization of functions with low effective dimensionality, that are constant along certain (unknown) linear subspaces. Extending the techn…
Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions
Coralia Cartis, Nick Gould, Philippe L. Toint
We introduce the concept of strong high-order approximate minimizers for nonconvex optimization problems. These apply in both standard smooth and composite non-smooth settings, and…