17 citations · 84 across the 29 of their papers we have counts for
4 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…
Adaptive Regularization for Nonconvex Optimization Using Inexact Function Values and Randomly Perturbed Derivatives
S. Bellavia, G. Gurioli, B. Morini +1
A regularization algorithm allowing random noise in derivatives and inexact function values is proposed for computing approximate local critical points of any order for smooth unco…
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…
Exploiting problem structure in derivative free optimization
Margherita Porcelli, Philippe L. Toint
A structured version of derivative-free random pattern search optimization algorithms is introduced which is able to exploit coordinate partially separable structure (typically ass…