default search action
Clément W. Royer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Clément W. Royer, Oumaima Sohab
, Luís Nunes Vicente:
Full-low evaluation methods for bound and linearly constrained derivative-free optimization. Comput. Optim. Appl. 89(2): 279-315 (2024) - [j13]Akwum Onwunta, Clément W. Royer
Complexity Analysis of Regularization Methods for Implicitly Constrained Least Squares. J. Sci. Comput. 101(3): 54 (2024) - 2023
- [j12]Warren L. Hare, Clément W. Royer
Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization. Optim. Lett. 17(8): 1739-1756 (2023) - [j11]Lindon Roberts
Direct Search Based on Probabilistic Descent in Reduced Spaces. SIAM J. Optim. 33(4): 3057-3082 (2023) - [i3]Warren L. Hare, Gabriel Jarry-Bolduc, Sébastien Kerleau, Clément W. Royer:
Using orthogonally structured positive bases for constructing positive k-spanning sets with cosine measure guarantees. CoRR abs/2306.06383 (2023) - 2022
- [j10]Rémi Chan-Renous-Legoubin
A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression. EURO J. Comput. Optim. 10: 100044 (2022) - [j9]El Houcine Bergou
A Subsampling Line-Search Method with Second-Order Results. INFORMS J. Optim. 4(4): 403-425 (2022) - [j8]El Houcine Bergou, Youssef Diouane
A Stochastic Levenberg-Marquardt Method Using Random Models with Complexity Results. SIAM/ASA J. Uncertain. Quantification 10(1): 507-536 (2022) - 2021
- [j7]Frank E. Curtis
Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization. SIAM J. Optim. 31(1): 518-544 (2021) - [j6]El Houcine Bergou, Youssef Diouane
A Nonmonotone Matrix-Free Algorithm for Nonlinear Equality-Constrained Least-Squares Problems. SIAM J. Sci. Comput. 43(5): S743-S766 (2021) - 2020
- [j5]Serge Gratton, Clément W. Royer
A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds. Math. Program. 179(1): 195-222 (2020) - [j4]Clément W. Royer
A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization. Math. Program. 180(1): 451-488 (2020) - [c1]Laurent Meunier, Yann Chevaleyre, Jérémy Rapin, Clément W. Royer, Olivier Teytaud:
On Averaging the Best Samples in Evolutionary Computation. PPSN (2) 2020: 661-674 - [i2]Laurent Meunier, Yann Chevaleyre, Jérémy Rapin, Clément W. Royer, Olivier Teytaud:
Proving μ>1. CoRR abs/2004.11685 (2020) - [i1]El Houcine Bergou, Youssef Diouane, Vyacheslav Kungurtsev, Clément W. Royer:
A Nonmonotone Matrix-Free Algorithm for Nonlinear Equality-Constrained Inverse Problems. CoRR abs/2006.16340 (2020)
2010 – 2019
- 2019
- [j3]Serge Gratton, Clément W. Royer
Direct search based on probabilistic feasible descent for bound and linearly constrained problems. Comput. Optim. Appl. 72(3): 525-559 (2019) - 2018
- [j2]Clément W. Royer
Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization. SIAM J. Optim. 28(2): 1448-1477 (2018) - 2015
- [j1]Serge Gratton, Clément W. Royer
Direct Search Based on Probabilistic Descent. SIAM J. Optim. 25(3): 1515-1541 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: