Large-Scale and Distributed Optimization: Workshop Program
Tuesday, June 13
11:05-11:50 14:05-15:00 | Focus period seminars (seminar room of Automatic Control Department, Ole Römers väg 1, Lund) |
17:00-19:00 | Welcoming reception and registration at the Pufendorf Institute in Biskopsgatan 3 (map). |
Wednesday, June 14
10:00 | Registration at Ideon and Coffee |
10:30 | Opening remarks |
10:40 | Graph Structure in Polynomial Systems: Chordal Networks
Pablo A. Parrilo, MIT
Learning Regularizers from Data
Venkat Chandrasekaran, Caltech
|
12:00 | Lunch |
14:00 | Fast Distributed Algorithms for Optimization in Time-Varying Graphs
Angelia Nedich, Arizona State University
Accelerated Min-Sum for consensus
Patrick Rebeschini, Yale University
|
15:20 | Coffee |
15:50 | Accelerated Douglas-Rachford splitting and ADMM for structured nonconvex optimization
Panos Patrinos, KU Leuven
|
Thursday, June 15
09:00 | Convex Optimization with Abstract Linear Operators
Stephen Boyd, Stanford University
Sketchy Decisions: Convex Low-Rank Matrix Optimization with Optimal Storage
Madeleine Udell, Cornell University
|
10:20 | Coffee |
10:50 | Primal and Dual Predicted Decrease Approximation Methods
Amir Beck, Technion
A Globally Linearly Convergent Method for Large-Scale Pointwise Quadratically Supportable Convex-Concave Saddle Point Problems
Russell Luke, University of Göttingen
|
12:10 | Lunch |
14:00 | Robust control for the analysis and design of large-scale optimization algorithms
Laurent Lessard, University of Wisconsin - Madison
Optimal and Long-Step Feasibility Algorithms
Pontus Giselsson, Lund University
|
15:20 | Coffee and demo |
16:00 | Low-Rank Inducing Norms with Optimality Interpretations
Christian Grussler, Lund University
|
18:30 | Symposium Dinner at Hypoteket |
Friday, June 16
09:00 | Optimal algorithms for smooth and strongly convex distributed optimization in networks
Francis Bach, École normale supérieure
A Generic Quasi-Newton Algorithm for Faster Gradient-Based Optimization
Julien Mairal, INRIA - Grenoble
|
10:20 | Coffee |
10:50 | Distributed Robustness Analysis
Anders Hansson, Linköping University
Sparsity and asynchrony in distributed optimization: models and convergence results
Mikael Johansson, Royal Institute of Technology, Stockholm
|
12:10 | Lunch |
14:00 | The proximal augmented Lagrangian method for nonsmooth composite optimization
Mihailo Jovanovic, University of Southern California
Randomized Primal-Dual Algorithms for Distributed Empirical Risk Minimization
Lin Xiao, Microsoft Research, Redmond
|
15:20 | Coffee |
15:50 | A Unified Analysis of Stochastic Optimization Methods Using Jump System Theory and Quadratic Constraints
Anders Rantzer, Lund University
|
16:30 | Final remarks - end of the workshop |