Follow
Clément W. Royer
Clément W. Royer
Université Paris Dauphine-PSL
Verified email at dauphine.psl.eu - Homepage
Title
Cited by
Cited by
Year
Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization
CW Royer, SJ Wright
SIAM Journal on Optimization 28 (2), 1448-1477, 2018
1042018
Direct search based on probabilistic descent
S Gratton, CW Royer, LN Vicente, Z Zhang
SIAM Journal on Optimization 25 (3), 1515-1541, 2015
922015
A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
CW Royer, M O’Neill, SJ Wright
Mathematical Programming 180 (1), 451-488, 2020
872020
Complexity and global rates of trust-region methods based on probabilistic models
S Gratton, CW Royer, LN Vicente, Z Zhang
IMA Journal of Numerical Analysis 38 (3), 1579-1597, 2018
662018
Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization
FE Curtis, DP Robinson, CW Royer, SJ Wright
SIAM Journal on Optimization 31 (1), 518-544, 2021
312021
Direct search based on probabilistic feasible descent for bound and linearly constrained problems
S Gratton, CW Royer, LN Vicente, Z Zhang
Computational Optimization and Applications 72 (3), 525-559, 2019
282019
A subsampling line-search method with second-order results
EH Bergou, Y Diouane, V Kunc, V Kungurtsev, CW Royer
INFORMS Journal on Optimization 4 (4), 403-425, 2022
272022
A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds
S Gratton, CW Royer, LN Vicente
Mathematical Programming, 1-28, 2018
222018
A stochastic Levenberg-Marquardt method using random models with complexity results and application to data assimilation
E Bergou, Y Diouane, V Kungurtsev, CW Royer
SIAM/ASA Journal on Uncertainty Quantification 10 (1), 507-536, 2022
18*2022
A second-order globally convergent direct-search method and its worst-case complexity
S Gratton, CW Royer, LN Vicente
Optimization 65 (6), 1105-1128, 2016
162016
Direct search based on probabilistic descent in reduced spaces
L Roberts, CW Royer
SIAM Journal on Optimization 33 (4), 3057-3082, 2023
132023
A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression
R Chan--Renous-Legoubin, CW Royer
EURO Journal on Computational Optimization 10, 100044, 2022
9*2022
On averaging the best samples in evolutionary computation
L Meunier, Y Chevaleyre, J Rapin, CW Royer, O Teytaud
Parallel Problem Solving from Nature–PPSN XVI: 16th International Conference …, 2020
72020
Using orthogonally structured positive bases for constructing positive k-spanning sets with cosine measure guarantees
W Hare, G Jarry-Bolduc, S Kerleau, CW Royer
Linear Algebra and its Applications 680, 183-207, 2024
22024
A Nonmonotone Matrix-Free Algorithm for Nonlinear Equality-Constrained Least-Squares Problems
EH Bergou, Y Diouane, V Kungurtsev, CW Royer
SIAM Journal on Scientific Computing 43 (5), S743-S766, 2021
2*2021
Derivative-free optimization methods based on probabilistic and deterministic properties: complexity analysis and numerical relevance
CW Royer
Université Paul Sabatier-Toulouse III, 2016
22016
Expected decrease for derivative-free algorithms using random subspaces
W Hare, L Roberts, CW Royer
arXiv preprint arXiv:2308.04734, 2023
12023
Revisiting Theoretical Guarantees of Direct-Search Methods
KJ Dzahini, F Rinaldi, CW Royer, D Zeffiro
arXiv preprint arXiv:2403.05322, 2024
2024
Riemannian trust-region methods for strict saddle functions with complexity guarantees
F Goyens, CW Royer
arXiv preprint arXiv:2402.07614, 2024
2024
Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization
W Hare, CW Royer
Optimization Letters 17 (8), 1739-1756, 2023
2023
The system can't perform the operation now. Try again later.
Articles 1–20