Direct Search Based on Probabilistic Descent. - Serge Gratton; Clément W. Royer; Luís Nunes Vicente; Zaikun Zhang (SIAM J. Optim., 2015)

Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization. - Clément W. Royer; Stephen J. Wright 001 (SIAM J. Optim., 2018)

Direct search based on probabilistic feasible descent for bound and linearly constrained problems. - Serge Gratton; Clément W. Royer; Luís Nunes Vicente; Zaikun Zhang (Comput. Optim. Appl., 2019)

On Averaging the Best Samples in Evolutionary Computation. - Laurent Meunier; Yann Chevaleyre; Jérémy Rapin; Clément W. Royer; Olivier Teytaud (PPSN (2), 2020)

Proving μ>1. - Laurent Meunier; Yann Chevaleyre; Jérémy Rapin; Clément W. Royer; Olivier Teytaud (CoRR, 2020)

A Nonmonotone Matrix-Free Algorithm for Nonlinear Equality-Constrained Inverse Problems. - El Houcine Bergou; Youssef Diouane; Vyacheslav Kungurtsev; Clément W. Royer (CoRR, 2020)

A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds. - Serge Gratton; Clément W. Royer; Luís Nunes Vicente (Math. Program., 2020)

A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization. - Clément W. Royer; Michael O'Neill 002; Stephen J. Wright 001 (Math. Program., 2020)

Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization. - Frank E. Curtis; Daniel P. Robinson; Clément W. Royer; Stephen J. Wright 001 (SIAM J. Optim., 2021)

A Nonmonotone Matrix-Free Algorithm for Nonlinear Equality-Constrained Least-Squares Problems. - El Houcine Bergou; Youssef Diouane; Vyacheslav Kungurtsev; Clément W. Royer (SIAM J. Sci. Comput., 2021)

A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression. - Rémi Chan-Renous-Legoubin; Clément W. Royer (EURO J. Comput. Optim., 2022)

A Stochastic Levenberg-Marquardt Method Using Random Models with Complexity Results. - El Houcine Bergou; Youssef Diouane; Vyacheslav Kungurtsev; Clément W. Royer (SIAM/ASA J. Uncertain. Quantification, 2022)

A Subsampling Line-Search Method with Second-Order Results. - El Houcine Bergou; Youssef Diouane; Vladimir Kunc; Vyacheslav Kungurtsev; Clément W. Royer (INFORMS J. Optim., 2022)

Using orthogonally structured positive bases for constructing positive k-spanning sets with cosine measure guarantees. - Warren L. Hare; Gabriel Jarry-Bolduc; Sébastien Kerleau; Clément W. Royer (CoRR, 2023)

Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization. - Warren L. Hare; Clément W. Royer (Optim. Lett., 2023)

Direct Search Based on Probabilistic Descent in Reduced Spaces. - Lindon Roberts; Clément W. Royer (SIAM J. Optim., 2023)

A characterization of positive spanning sets with ties to strongly connected digraphs. - Denis Cornaz; Sébastien Kerleau; Clément W. Royer (CoRR, 2024)

Expected decrease for derivative-free algorithms using random subspaces. - Warren L. Hare; Lindon Roberts; Clément W. Royer (Math. Comput., 2024)

Full-low evaluation methods for bound and linearly constrained derivative-free optimization. - Clément W. Royer; Oumaima Sohab; Luís Nunes Vicente (Comput. Optim. Appl., 2024)

Complexity Analysis of Regularization Methods for Implicitly Constrained Least Squares. - Akwum Onwunta; Clément W. Royer (J. Sci. Comput., 2024)

A characterization of positive spanning sets with ties to strongly edge-connected digraphs. - Denis Cornaz; Sébastien Kerleau; Clément W. Royer (Discret. Appl. Math., 2025)