Clément W. Royer

Orcid: 0000-0003-2452-2172

According to our database1, Clément W. Royer authored at least 24 papers between 2015 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
A line search framework with restarting for noisy optimization problems.
Comput. Optim. Appl., April, 2026

2025
Riemannian trust-region methods for strict saddle functions with complexity guarantees.
Math. Program., September, 2025

Direct-search methods in the year 2025: Theoretical guarantees and algorithmic paradigms.
EURO J. Comput. Optim., 2025

A characterization of positive spanning sets with ties to strongly edge-connected digraphs.
Discret. Appl. Math., 2025

2024
Complexity Analysis of Regularization Methods for Implicitly Constrained Least Squares.
J. Sci. Comput., December, 2024

Full-low evaluation methods for bound and linearly constrained derivative-free optimization.
Comput. Optim. Appl., November, 2024

Expected decrease for derivative-free algorithms using random subspaces.
Math. Comput., 2024

A characterization of positive spanning sets with ties to strongly connected digraphs.
CoRR, 2024

2023
Direct Search Based on Probabilistic Descent in Reduced Spaces.
SIAM J. Optim., December, 2023

Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization.
Optim. Lett., November, 2023

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

2022
A Subsampling Line-Search Method with Second-Order Results.
INFORMS J. Optim., October, 2022

A Stochastic Levenberg-Marquardt Method Using Random Models with Complexity Results.
SIAM/ASA J. Uncertain. Quantification, 2022

A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression.
EURO J. Comput. Optim., 2022

2021
A Nonmonotone Matrix-Free Algorithm for Nonlinear Equality-Constrained Least-Squares Problems.
SIAM J. Sci. Comput., 2021

Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization.
SIAM J. Optim., 2021

2020
A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization.
Math. Program., 2020

A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds.
Math. Program., 2020

A Nonmonotone Matrix-Free Algorithm for Nonlinear Equality-Constrained Inverse Problems.
CoRR, 2020

Proving μ>1.
CoRR, 2020

On Averaging the Best Samples in Evolutionary Computation.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

2019
Direct search based on probabilistic feasible descent for bound and linearly constrained problems.
Comput. Optim. Appl., 2019

2018
Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization.
SIAM J. Optim., 2018

2015
Direct Search Based on Probabilistic Descent.
SIAM J. Optim., 2015


  Loading...