Gabriel Jarry-Bolduc

Optim. Lett., September, 2023

About the Performance of a Calculus-Based Approach to Building Model Functions in a Derivative-Free Trust-Region Algorithm.

[BibT_eX]

[DOI]

Algorithms, February, 2023

Using generalized simplex methods to approximate derivatives.

[BibT_eX]

[DOI]

CoRR, 2023

Using orthogonally structured positive bases for constructing positive k-spanning sets with cosine measure guarantees.

[BibT_eX]

[DOI]

CoRR, 2023

A matrix algebra approach to approximate Hessians.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Approximating the diagonal of a Hessian: which sample set of points should be used.

[BibT_eX]

[DOI]

Numer. Algorithms, 2022

2021

Limiting behavior of derivative approximation techniques as the number of points tends to infinity on a fixed interval in R.

[BibT_eX]

[DOI]

Phillip Braun

J. Comput. Appl. Math., 2021

Error Analysis of Surrogate Models Constructed through Operations on Sub-models.

[BibT_eX]

[DOI]

Yiwen Chen

CoRR, 2021

Limiting behaviour of the generalized simplex gradient as the number of points tends to infinity on a fixed shape in R^n.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Calculus Identities for Generalized Simplex Gradients: Rules and Applications.

[BibT_eX]

[DOI]

SIAM J. Optim., 2020

Uniform simplex of an arbitrary orientation.

[BibT_eX]

[DOI]

Patrick Nadeau

Shambhavi Singh

Optim. Lett., 2020

A deterministic algorithm to compute the cosine measure of a finite positive spanning set.

[BibT_eX]

[DOI]

Optim. Lett., 2020

Error bounds for overdetermined and underdetermined generalized centred simplex gradients.

[BibT_eX]

[DOI]