Iteration complexity and finite-time efficiency of adaptive sampling trust-region methods for stochastic derivative-free optimization
Y Ha, S Shashaani - IISE Transactions, 2024 - Taylor & Francis
ASTRO-DF is a prominent trust-region method using adaptive sampling for stochastic
derivative-free optimization of nonconvex problems. Its salient feature is an easy-to …
derivative-free optimization of nonconvex problems. Its salient feature is an easy-to …
Ensemble-based gradient inference for particle methods in optimization and sampling
We propose an approach based on function evaluations and Bayesian inference to extract
higher-order differential information of objective functions from a given ensemble of …
higher-order differential information of objective functions from a given ensemble of …
Error bounds for overdetermined and underdetermined generalized centred simplex gradients
W Hare, G Jarry–Bolduc… - IMA Journal of Numerical …, 2022 - academic.oup.com
Abstract Using the Moore–Penrose pseudoinverse this work generalizes the gradient
approximation technique called the centred simplex gradient to allow sample sets …
approximation technique called the centred simplex gradient to allow sample sets …
A matrix algebra approach to approximate Hessians
W Hare, G Jarry-Bolduc… - IMA Journal of Numerical …, 2023 - academic.oup.com
This work presents a novel matrix-based method for constructing an approximation Hessian
using only function evaluations. The method requires less computational power than …
using only function evaluations. The method requires less computational power than …
Improved complexity of trust-region optimization for zeroth-order stochastic oracles with adaptive sampling
We present an enhanced stochastic trust-region optimization with adaptive sampling
(ASTRO-DF) in which optimizing an iteratively constructed local model on estimates of …
(ASTRO-DF) in which optimizing an iteratively constructed local model on estimates of …
Approximating the diagonal of a Hessian: which sample set of points should be used
G Jarry–Bolduc - Numerical Algorithms, 2022 - Springer
An explicit formula based on matrix algebra to approximate the diagonal entries of a
Hessian matrix with any number of sample points is introduced. When the derivative-free …
Hessian matrix with any number of sample points is introduced. When the derivative-free …
Using generalized simplex methods to approximate derivatives
G Jarry-Bolduc, C Planiden - arXiv preprint arXiv:2310.16997, 2023 - arxiv.org
This paper presents two methods for approximating a proper subset of the entries of a
Hessian using only function evaluations. These approximations are obtained using the …
Hessian using only function evaluations. These approximations are obtained using the …