My CV
Publications
Talks
Teaching
Numerics
Main page

Contact

Clément W. Royer

La version française de cette page se trouve ici.

---

Submitted preprints

Revisiting theoretical guarantees of direct-search methods
     K. J. Dzahini, F. Rinaldi, C. W. Royer and D. Zeffiro.
     Technical report arXiv:2403.05322, March 2024.
Riemannian trust-region methods for strict saddle functions with complexity guarantees
     F. Goyens and C. W. Royer.
     Technical report arXiv:2402.07614, February 2024.
Full-low evaluation methods for bound and linearly constrained derivative-free optimization
     C. W. Royer, O. Sohab and L. N. Vicente.
     Technical report arXiv:2310.00755, October 2023.
Complexity analysis of regularization methods for implicitly constrained least squares
     A. Onwunta and C. W. Royer.
     Technical report arXiv:2309.07086, revised October 2023.
Expected decrease for derivative-free algorithms using random subspaces
     W. Hare, L. Roberts and C. W. Royer.
     Technical report arXiv:2308.04734, August 2023.

Articles in refereed journals

Using orthogonally structured positive bases for constructing positive k-spanning sets with cosine measure guarantees
     W. Hare, G. Jarry-Bolduc, S. Kerleau and C. W. Royer.
     Linear Algebra and its Applications, 680:183-207, 2024.
Direct search based on probabilistic descent in reduced spaces
     L. Roberts and C. W. Royer.
     SIAM Journal on Optimization, 33(4):3057-3082, 2023.
Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization
     W. Hare and C. W. Royer.
     Optimization Letters, 17:1739-1756, 2023.
A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression
     R. Chan--Renous-Legoubin and C. W. Royer.
     EURO Journal on Computational Optimization, 10:100044, 2022.
A subsampling line-search method with second-order results
     E. Bergou, Y. Diouane, V. Kunc, V. Kungurstev and C. W. Royer.
     INFORMS Journal on Optimization, 4(4):403-425, 2022.
A stochastic Levenberg-Marquardt method using random models with complexity results
     E. Bergou, Y. Diouane, V. Kungurstev and C. W. Royer.
     SIAM/ASA Journal on Uncertainty Quantification, 10(1):507-536, 2022.
A nonmonotone matrix-free algorithm for nonlinear equality-constrained least-squares problems
     E. Bergou, Y. Diouane, V. Kungurstev and C. W. Royer.
     SIAM Journal on Scientific Computing, 43(5):S743-S766, 2021.
Trust-region Newton-CG with strong second-order complexity guarantees for nonconvex optimization
     F. E. Curtis, D. P. Robinson, C. W. Royer and S. J. Wright.
     SIAM Journal on Optimization, 31(1):518-544, 2021.
A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
     C. W. Royer, M. O'Neill and S. J. Wright.
     Mathematical Programming, 180:451-488, 2020.
A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds
     S. Gratton, C. W. Royer and L. N. Vicente.
     Mathematical Programming, 179(1):195-222, 2020.
Direct search based on probabilistic feasible descent for bound and linearly constrained problems
     S. Gratton, C. W. Royer, L. N. Vicente and Z. Zhang.
     Computational Optimization and Applications, 72(3):525-559, 2019.(COAP Best Paper prize for 2019.)
Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization
     C. W. Royer and S. J. Wright.
     SIAM Journal on Optimization, 28(2):1448-1477, 2018.
Complexity and global rates of trust-region methods based on probabilistic models
     S. Gratton, C. W. Royer, L. N. Vicente and Z. Zhang.
     IMA Journal of Numerical Analysis, 38(3):1579-1597, 2018.
A second-order globally convergent direct-search method and its worst-case complexity
     S. Gratton, C. W. Royer and L. N. Vicente.
     Optimization, 65(6):1105-1128, 2016.
Direct search based on probabilistic descent
     S. Gratton, C. W. Royer, L. N. Vicente and Z. Zhang.
     SIAM Journal on Optimization, 25(3):1515-1541, 2015.

Conference proceedings

On averaging the best samples in evolutionary computation
     L. Meunier, Y. Chevaleyre, J. Rapin, C. W. Royer and O. Teytaud.
     Parallel Problem Solving from Nature - PPSN XVI, 661-674, Springer, 2020.
On the injectivity and nonfocal domains of the ellipsoid of revolution
     J.-B. Caillau and C. W. Royer.
     Geometric Control Theory and Sub-Riemannian Geometry, 73-86, Springer, 2014
     Proceedings of the INDAM meeting on Geometric Control and sub-Riemannian geometry, May 2012.

PhD Thesis

Derivative-Free Optimization Methods based on Probabilistic and Deterministic Properties: Complexity Analysis and Numerical Relevance.
     C. W. Royer, University of Toulouse, November 2016.
     Defence slides

Top of the page

---

List of collaborators (in reverse chronological order)

Damiano Zeffiro, Francesco Rinaldi, Kwassi Joseph Dzahini, Florentin Goyens, Oumaima Sohab, Akwum Onwunta, Sébastien Kerleau, Gabriel Jarry-Bolduc, Warren Hare, Lindon Roberts, Rémi Chan--Renous-Legoubin, Olivier Teytaud, Jérémy Rapin, Yann Chevaleyre, Laurent Meunier, Vladimir Kunc, Daniel P. Robinson, Frank E. Curtis, Vyacheslav Kungurstev, Youssef Diouane, El Houcine Bergou, Michael O'Neill, Stephen J. Wright, Zaikun Zhang, Luís Nunes Vicente, Serge Gratton, Jean-Baptiste Caillau.

Top of the page

---