Main page


Email : croyer2(at)
Clément Royer
Wisconsin Institute for Discovery
330 N Orchard St
Madison, WI 53715

Clément W. Royer

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

Welcome to my web page. Here you can learn a little about me and my research interests. You can also have a look at my publications, my teaching activities, the codes that I have written and the talks that I have given.
Enjoy your visit !

Latest news

October 2018 - My collaboration with El Houcine Bergou, Youssef Diouane and Vyacheslav Kungurstev has generated two works on randomized algorithms. The first one targets stochastic nonlinear least-squares, for which only randomly perturbed objective values are available. The second one describes a line-search algorithm for finite-sum problems, considering that only (random) samples of this sum are used at every iteration of the method.

Short bio

  • I am a postdoctoral research associate within the Wisconsin Institute for Discovery, in Madison, Wisconsin (USA). I am fortunate to be supervised by Stephen J. Wright.

  • On November 4, 2016, I was granted a PhD in applied mathematics from the university of Toulouse, delivered by the Université Toulouse III Paul Sabatier. It was prepared at the Institut de Recherche en Informatique de Toulouse, under the joint supervision of Serge Gratton and Luís Nunes Vicente.

  • From 2013 to 2016, I was a teaching assistant (moniteur, in charge of lab and tutorial sessions) at the French Engineering School ENSEEIHT.

  • I obtained my Engineer degree (equivalent to Master's Degree) in Computer Science and Applied Mathematics, as well as my Master in Computer Science from Toulouse INP (National Polytechnic Institute).

  • For more information, you can have a look at my vitae in a short or extended format.

    Research interests

    My research essentially revolves around the field of numerical optimization and its applications, particularly in complex systems and data science.
    My current work aims at developing efficient nonconvex optimization algorithms, with a focus on using randomized linear algebra and establishing complexity guarantees.
    Following the lines of my Ph.D., I also maintain a high interest in derivative-free optimization.

    This page was designed by Clothilde Royer, many thanks to her.
    Materials on this page are available under Creative Commons CC BY-NC 4.0 license.