Articles
Hare W., Roberts L., Royer C. (2025), Expected decrease for derivative-free algorithms using random subspaces, Mathematics of Computation, vol. 94, n°351, p. 277-304 
Onwunta A., Royer C. (2024), Complexity Analysis of Regularization Methods for Implicitly Constrained Least Squares, Journal of Scientific Computing, vol. 101, n°54
Royer C., Sohab O., Vicente L. (2024), Full-low evaluation methods for bound and linearly constrained derivative-free optimization, Computational Optimization and Applications, vol. 89, n°2, p. 279-315
Hare W., Jarry-Bolduc G., Kerleau S., Royer C. (2024), Using orthogonally structured positive bases for constructing positive k-spanning sets with cosine measure guarantees, Linear Algebra and its Applications, vol. 680, p. 183-207
Goyens F., Royer C. (2024), Riemannian trust-region methods for strict saddle functions with complexity guarantees, Mathematical Programming, p. 1-36
Roberts L., Royer C. (2023), Direct Search Based on Probabilistic Descent in Reduced Spaces, SIAM Journal on Optimization, vol. 33, n°4, p. 3057-3082
Hare W., Royer C. (2023), Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization, Optimization Letters, vol. 17, p. 1739-1756
Bergou E., Diouane Y., Kunc V., Kungurtsev V., Royer C. (2022), A Subsampling Line-Search Method with Second-Order Results, INFORMS Journal on Optimization, vol. 4, n°4, p. 347-445
Chan-Renous-Legoubin R., Royer C. (2022), A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression, EURO Journal on Computational Optimization, vol. 10, p. 100044
Bergou E., Diouane Y., Kungurtsev V., Royer C. (2022), A stochastic Levenberg-Marquardt method using random models with complexity results, SIAM/ASA Journal on Uncertainty Quantification, vol. 10, n°1, p. 507-536
Bergou E., Diouane Y., Kungurtsev V., Royer C. (2021), A Nonmonotone Matrix-Free Algorithm for Nonlinear Equality-Constrained Least-Squares Problems, SIAM Journal on Scientific Computing, vol. 43, n°5, p. S743-S766
Curtis F., Robinson D., Royer C., Wright S. (2021), Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization, SIAM Journal on Optimization, vol. 31, n°1, p. 518-544
Royer C., O’Neill M., Wright S. (2020), A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization, Mathematical Programming, vol. 180, n°1-2, p. 451–488
Gratton S., Royer C., Vicente L. (2020), A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds, Mathematical Programming, vol. 179, n°1-2, p. 195–222
Gratton S., Royer C., Vicente L., Zhang Z. (2019), Direct search based on probabilistic feasible descent for bound and linearly constrained problems, Computational Optimization and Applications, vol. 72, n°3, p. 525-559
Gratton S., Royer C., Vicente L., Zhang Z. (2018), Complexity and global rates of trust-region methods based on probabilistic models, IMA Journal of Numerical Analysis, vol. 38, n°3, p. 1579-1597
Royer C., Wright S. (2018), Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization, SIAM Journal on Optimization, vol. 28, n°2, p. 1448-1477
Gratton S., Royer C., Vicente L. (2015), A second-order globally convergent direct-search method and its worst-case complexity, Optimization. A Journal of Mathematical Programming and Operations Research, vol. 65, n°6, p. 1105-1128
Gratton S., Royer C., Vicente L., Zhang Z. (2015), Direct Search Based on Probabilistic Descent, SIAM Journal on Optimization, vol. 25, n°3, p. 1515-1541
