Speakers
Semi-plenary speakers
- Toh, Kim-Chuan - National University of Singapore, Singapore
Invited speakers
- Alacaoglu, Ahmet - University of Wisconsin-Madison, USA
- Boumal, Nicolas - EPFL, Switzerland
- Cartis, Coralia - Oxford University, UK
- Curtis, Frank - Lehigh University, USA
- Davis, Damek - Cornell, USA
- Gratton, Serge - ENSEEIHT, France
- Hall, Georgina - INSEAD/INRIA, France
- Hauser, Raphael - Oxford University, UK
- He, Niao - ETHZ, Switzerland
- Hintermueller, Michael - Humboldt University of Berlin, Germany
- Hoheisel, Tim - McGill University, Canada
- Kuhn, Daniel - EPFL, Switzerland
- Malitsky, Yurii - University of Vienna, Austria
- Mehlitz, Patrick - Universität Mannheim, Germany
- Pang, Jong-Shi - USC, USA
- Paquette, Courtney - McGill University/Google Brain, Canada
- Pataki, Gabor - UNC-Chapel Hill, USA
- Roosta, Fred - University of Queensland, Australia
- Royer, Clement - Universite Paris Dauphine, France
- Shanbhag, Uday - Penn State, USA
- Zemkoho, Alain - Southampton University, UK
Preliminary program
This schedule is preliminary and could be updated.
Thursday, June 15
| 14:00 ~ 14:30 | On the minimization of piecewise functions: pseudo stationarity Jong-Shi Pang - University of Southern California, USA |
| 14:30 ~ 15:00 | Complexity Guarantees for Chance-Constrained Optimization by leveraging Minkowski Functionals Uday Shanbhag - Pennsylvania State University, USA |
| 15:00 ~ 15:30 | Adaptive Stochastic Algorithms for Nonlinearly Constrained Optimization Frank E. Curtis - Lehigh University, USA |
| 15:30 ~ 16:00 | A Newton-MR Algorithm With Complexity Guarantees for Nonconvex Optimization Fred Roosta - University of Queensland, Australia |
| 16:30 ~ 17:00 | TBA Michael Hintermuller - Humboldt-Universität zu Berlin, Germany |
| 17:00 ~ 17:30 | Nonsmooth optimization and augmented Lagrangian methods Patrick Mehlitz - BTU Cottbus-Senftenberg, Germany |
| 17:30 ~ 18:30 | Algorithms for large scale semidefinite programming Kim-Chuan Toh - National University of Singapore, Singapore |
Friday, June 16
| 14:00 ~ 14:30 | Subspace methods for nonconvex optimization Coralia Cartis - University of Oxford, United Kingdom |
| 14:30 ~ 15:00 | Homogenization of SGD in High-dimensions Courtney Paquette - McGill University/Google Brain, Canada |
| 15:00 ~ 15:30 | Non-convex optimization when the solution is not unique: A kaleidoscope of favorable conditions Nicolas Boumal - EPFL, Switzerland |
| 15:30 ~ 16:00 | Optimal Design for Policy Learning across Related Locations Georgina Hall - INSEAD, France |
| 16:30 ~ 17:00 | Small Errors in Random Zeroth-Order Optimization are Imaginary Daniel Kuhn - EPFL, Switzerland |
| 17:00 ~ 17:30 | Two Sides of One Coin: the Limits of Untuned SGD and the Power of Adaptive Methods Niao He - ETH Zurich , Switzerland |
| 17:30 ~ 18:00 | Adaptive first-order methods for convex optimization Yura Malitsky - University of Vienna, Austria |
| 18:00 ~ 18:30 | On the Complexity of a Simple Primal-Dual Coordinate Method Ahmet Alacaoglu - University of Wisconsin-Madison, USA |
Saturday, June 17
| 14:00 ~ 14:30 | Bilevel hyperparameter optimization for nonlinear support vector machines Alain Zemkoho - University of Southampton, United Kingdom |
| 14:30 ~ 15:00 | Some applications of implicit function theorems from variational analysis Tim Hoheisel - McGill University, Canada |
| 15:00 ~ 15:30 | TBA Serge Gratton - ENSEEIHT, France |
| 15:30 ~ 16:00 | A Newton-type method for strict saddle functions Clément Royer - Université Paris Dauphine-PSL, France |
| 16:30 ~ 17:00 | Leveraging "partial" smoothness for faster convergence in nonsmooth optimization Davis Damek - Cornell University, USA |
| 17:00 ~ 17:30 | How do exponential size solutions arise in semidefinite programming? Gabor Pataki - University of North Carolina at Chapel Hill, USA |
| 17:30 ~ 18:00 | Line-Search for Piecewise Smooth Functions Raphael Hauser - University of Oxford, United Kingdom |
Posters
- Quadratic minimization: from conjugate gradient to an adaptive Heavy-ball method with Polyak step-sizes
Goujaud Baptiste - École Polytechnique, Institut Polytechnique de Paris, France - Hybrid methods for global optimization of large-scale polynomial problems
Gilles Bareilles - Czech Technical University, Czech Republic - Novel algorithms for nonconvex second-order optimization with strong performance guarantees
Chuan He - University of Minnesota, United States - A second order system attached to a monotone inclusion problem
David Alexander Hulett - University of Vienna, Austria - Semidefinite games
Constantin Ickstadt - Goethe Universität Frankfurt am Main, Germany - Variance-Reduction for SGD with Polyak Stepsizes and Line-Search
Xiaowen Jiang - CISPA Helmholtz Center for Information Security, Germany - Accelerated Adaptive Cubic Regularized Quasi-Newton Methods
Dmitry Kamzolov - Mohamed bin Zayed University of Artificial Intelligence(MBZUAI), UAE, United Arab Emirates (UAE) - An SDE perspective on stochastic convex optimization
Rodrigo Maulen - ENSICAEN, France - The rank-relaxed optimization landscape for orthogonal group synchronization on a general graph
Andrew McRae - EPFL, Switzerland - Consensus-Based Optimization: On Algorithms, Analysis, and Applications
Konstantin Riedl - Technical University of Munich, Munich Center for Machine Learning, Germany - An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems
Arnesh Sujanani - Georgia Institute of Technology, United States of America