One World Optimization Seminar

Since the outbreak of the coronavirus pandemic, the entire world has been forced to slow down. The scientific community has been no exception with cancellations of conferences, seminars and research visits. We are all forced to build up new communication channels and the One World Optimization Seminar is an attempt to keep our community together. The short term goal is to provide access to a seminar for as many researchers as possible. For the indefinite future, the seminar is intended to foster ideas among our truly global research community and to help reduce our impact on climate change.


The One World Optimization Seminar is organized by Radu Ioan Boț (University of Vienna), Shoham Sabach (Technion - Israel Institute of Technology Haifa) and Mathias Staudigl (Maastricht University).


 Previous talks

First season



15:00 CEST

Marc Teboulle

(Tel Aviv University)

Hidden Convexity in Nonconvex Quadratic Optimizationslides / video


15:00 CEST

Peter Richtárik


On Second Order Methods and Randomness

slides / video



15:00 CEST

Russell Luke

(University of Göttingen)

Iterated Self-Mappings in Nonlinear Spaces: The Case of Random Function Iterations and Inconsistent Stochastic Feasibilityslides / video


15:00 CEST

Wotao Yin


Scaled Relative Graphslides / video


15:00 CEST

Francis Bach


On the Convergence of Gradient Descent for Wide Two-Layer Neural Networks

[joint talk with the One World Seminar: Mathematical Methods for Arbitrary Data Sources]

slides / video


15:00 CEST

Patrick L. Combettes

(North Carolina State University)

Back to Single-Resolvent Iterations, with Warpingslides / video


15:00 CEST

Adrien Taylor


Computer-Aided Worst-Case Analyses and Design of First-Order Methods for Convex Optimizationslides / video


15:00 CEST

Volkan Cevher


Scalable Semidefinite Programmingslides / video


15:00 CEST

Alexandre d'Aspremont


Feature Selection & the Shapley - Folkman Theoremslides / video


15:00 CEST

Claudia Sagastizábal

(University of Campinas)

Revisiting Augmented Lagrangian Dualsslides / video


15:00 CEST

Yurii Nesterov

(University of Louvain)

Superfast Second-Order Methods for Unconstrained Convex Optimizationslides / video


15:00 CEST

Jérôme Bolte

(Toulouse School of Economics / University Toulouse Capitole)

A Variational Model for Nonsmooth Automatic Differentiation with Applications to Deep Learningslides / video


15:00 CEST

Panayotis Mertikopoulos


Games, Dynamics, and Optimization

[joint talk with the One World Mathematical Game Theory Seminar]

slides / video


15:00 CEST

Xiaoming Yuan

(University of Hong Kong)

From Optimization to Optimal Control: An Algorithmic Design Perspectiveslides / video


15:00 CEST

Coralia Carțiș

(University of Oxford)

Tensor Methods for Non-convex Optimization Problemsslides / video


Second season



15:30 CEST

Amir Beck

(Tel-Aviv University)

Dual Randomized Coordinate Descent Method for Solving a Class of Nonconvex Problemsslides / video


15:30 CEST

Jong-Shi Pang

(University of Southern California)

The Era of "Non"-Optimization Problemsslides / video


15:30 CEST

Adrian Lewis

(ORIE Cornell)

Smoothness in Nonsmooth Optimizationslides / video


15:30 CEST

Stephen Wright

(University of Wisconsin)

Second-Order Methods for Nonconvex Optimization with Complexity Guaranteesslides / video


15:30 CEST

Aris Daniilidis

(University of Chile / Autonomous University of Barcelona)

Asymptotic Study of the Sweeping Processslides / video


15:30 CEST

R. Tyrrell Rockafellar

(University of Washington)

Augmented Lagrangians and Hidden Convexity in Sufficient Conditions for Local Optimalityslides / video


15:30 CEST

Boris Polyak

(Institute for Control Science Moscow)

Static Linear Feedback for Control as Optimization Problemslides / video


15:30 CET

Michael P. Friedlander

(University of British Columbia)

Polar Deconvolution of Mixed Signalsslides / video


15:30 CET

Uday V. Shanbhag

(Pennsylvania State University)

Inexact and Distributed Best-Response Schemes for Stochastic Nash Equilibrium Problemsslides / video


15:30 CET

Ingrid Daubechies

(Duke University)

Discovering Low-Dimensional Manifolds in High-Dimensional Data Setsslides / video


15:30 CET

Asu Ozdaglar

(Massachusetts Institute of Technology)

Robustness in Machine Learning and Optimization: A Minmax Approachslides / video


15:30 CET

Dmitriy Drusvyatskiy

(University of Washington)

Stochastic Optimization with Decision-dependent Distributionsslides / video


15:30 CET

Defeng Sun

(Hong Kong Polytechnic University)

Several Observations about Using the ALM + Semismooth Newton Method for Solving Large Scale Semidefinite Programming and Beyondslides / video


15:30 CET

Guoyin Li

(University of New South Wales)

Estimating the Exponents of Kurdyka-Łojasiewicz (KL) Inequality and Error Bounds for Optimization Modelsslides / video


15:30 CET

Ya-xiang Yuan

(Chinese Academy of Sciences)

Orthogonality-free Approaches for Optimization Problems on Stiefel Manifoldslides / video


Third season



15:30 CET

Hedy Attouch

(University of Montpellier)

Acceleration of First-Order Optimization Algorithms via Inertial Dynamics with Hessian Driven Dampingslides / video


15:30 CET

Monique Laurent

(CWI Amsterdam & Tilburg University)

Sum-of-Squares Approximation Hierarchies for Polynomial Optimizationslides / video


15:30 CET

Boris Mordukhovich

(Wayne State University)

Generalized Newton Algorithms For Nonsmooth Systems With Applications To Lasso slides / video


15:30 CET

Roberto Cominetti

(Adolfo Ibáñez University)

Convergence Rates for Krasnoselskii-Mann Fixed-Point Iterationsslides / video


15:30 CET

Katya Scheinberg

(ORIE Cornell)

Complexity Analysis Framework of Adaptive Optimization Methods via Martingalesslides / video


15:30 CET

Jonathan Eckstein

(Rutgers University)

Progressive Hedging and Asynchronous Projective Hedging for Convex Stochastic Programmingslides / video


15:30 CET

Antonin Chambolle

(CMAP / École Polytechnique Palaiseau)

Derivatives of Solutions of Saddle-Point Problemsslides / video


15:30 CET

Lieven Vandenberghe


Bregman Proximal Methods for Semidefinite Optimizationslides / video


15:30 CET

Frank E. Curtis

(Lehigh University)

SQP Methods for Deterministically Constrained Stochastic Optimizationslides / video


15:30 CET

Gabriel Peyré

(CNRS & École Normale Supérieure)

Scaling Optimal Transport for High Dimensional Learningslides / video


15:30 CEST

Sylvain Sorin

(CNRS & Sorbonne University)

No-Regret Algorithms  in On-Line Learning, Games and Convex Optimizationslides / video


15:30 CEST

Henry Wolkowicz

(University of Waterloo)

Robust Interior Point Methods for Quantum Key Rate Computation for Quantum Key Distributionslides / video


15:30 CEST

Michael Ulbrich

(Technical University of Munich)

An Approximation Scheme for Distributionally Robust Nonlinear Optimization with Applications to PDE-Constrained Problems under Uncertaintyslides / video


15:30 CEST

Asen L. Dontchev

(University of Michigan)

Sensitivity Analysis without Derivativesslides / video


15:30 CEST

Bernd Sturmfels

(MPI Leipzig & UC Berkeley )

Wasserstein Distance to Independence Modelsslides / video


15:30 CEST

Jane J. Ye

(University of Victoria)

On Solving Bilevel Programming Problemsslides / video


15:30 CEST

Michael Hintermüller

(Weierstrass Institute / Humboldt University of Berlin)
Optimization with Learning-Informed Differential Equation Constraints and Its Applicationsslides / video


15:30 CEST

Marco Antonio López Cerdá

(University of Alicante)

Properties of Inequality Systems and Their Influence in Convex Optimizationslides / video


15:30 CEST

Mikhail Solodov

(IMPA Rio de Janeiro)

Regularized Smoothing for Solution Mappings of Convex Problems, with Applications to Two-Stage Stochastic Programming and Some Hierarchical Problemsslides / video


15:30 CEST

Daniel Kuhn


A General Framework for Optimal Data-Driven Optimizationslides / video


15:30 CEST

Constantin Zălinescu

(Octav Mayer Institute of Mathematics Iași)
On the Role of Interiority Notions in Convex Analysis and Optimizationslides / video


15:30 CEST

Darinka Dentcheva

(Stevens Institute of Technology)

Subregular Recourse in Multistage Stochastic Optimizationslides / video


15:30 CEST

Thomas Pock

(Graz University of Technology)

Learning with Markov Random Field Models for Computer Visionslides / video


15:30 CEST

Heinz H. Bauschke

(University of British Columbia Okanagan)

Compositions of Projection Mappings: Fixed Point Sets and Difference Vectorsslides / video


Fourth season ... with Early Career Researchers as speakers



15:30 CEST

Yura Malitsky 

(Linköping University)

Stochastic Variational Reduction for Variational Inequality Methodsslides / video


15:30 CEST

Edouard Pauwels

(Toulouse 3 Paul Sabatier University)

Nonsmooth Implicit Differentiation for Optimizationslides / video


15:30 CEST

Tim Hoheisel

(McGill University Montréal)

From Perspective Maps to Epigraphical Projectionsslides / video


15:30 CEST

Walaa Moursi

(University of Waterloo)

The Douglas-Rachford Algorithm for Solving Possibly Inconsistent Optimization Problemsslides / video


15:30 CEST

Ernest K. Ryu

(Seoul National University)

Non-Nesterov Acceleration Methods for Making Gradients Small in Convex Minimization and Convex-Concave Minimax Optimizationslides / video


15:30 CEST

Ernö Robert Csetnek

(University of Vienna)

Second Order Dynamics with Closed-Loop Dampingslides / video


15:30 CEST

Jingwei Liang

(Shanghai Jiao Tong University)

On the Acceleration of First-Order Methods and a New Oneslides / video


15:30 CET

Patrick Mehlitz

(Brandenburg University of Technology Cottbus-Senftenberg)

Optimization Problems with Geometric Constraints: Asymptotic Stationarity and an Augmented Lagrangian Methodslides / video


15:30 CET

Matthew Tam

(The University of Melbourne)

Resolvent Splitting with Minimal Liftingslides / video


15:30 CET

Ting Kei Pong

(The Hong Kong Polytechnic University)

Analysis and Algorithms for Some Compressed Sensing Models Based on the Ratio of l1 and l2 Normsslides / video


15:30 CET

Peter Ochs

(University of Tübingen)

An Inertial Non-smooth Non-convex Bregman Minimization Frameworkslides / video


15:30 CET

Damek Davis

(Cornell University)

Avoiding Saddle Points in Nonsmooth Optimizationslides / video


15:30 CET

Konstantin Mishchenko

(INRIA Sierra Paris)

Regularized Newton Method with Global O(1/k^2) Convergenceslides / video


15:30 CET

Dan Garber

(Technion Haifa)

Projection-Efficient First-Order Methods for Convex Low-Rank Matrix Optimizationslides / video


15:30 CET

Meisam Razaviyayn

(University of Southern California)

Nonconvex Min-Max Optimizationslides / video


15:30 CET

Ying Cui

(University of Minnesota)

A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourseslides / video


15:30 CET

Pontus Giselsson

(Lund University)

Nonlinear Forward-Backward Splitting with Projection or Momentum Correctionslides / video


15:30 CET

Geovani Nunes Grapiglia

(UC Louvain)

Quadratic Regularization Methods with Finite-Difference Gradient Approximationsslides / video


15:30 CET

Patrick Johnstone

(Brookhaven National Laboratory)

Stochastic and Variance-Reduced Monotone Operator Splittingslides / video


15:30 CET

Pavel Dvurechensky

(WIAS Berlin)

Accelerated Alternating Minimization Methods with Application to Optimal Transportslides / video


15:30 CET

Matthew Colbrook

(University of Cambridge)

On the Barriers of Deep Learning, Approximate Sharpness, and Smale's 18th Problem slides / video


15:30 CET

Shimrit Shtern

(Technion Haifa)

First-Order Algorithms for Simple Convex Bi-Level Problemsslides / video


15:30 CET

Junyi Liu

(Tsinghua University)

Solving Nonconvex and Nondifferentiable Compound Stochastic Programs with Applications to Risk Measure Minimizationslides / video


15:30 CET

Bruno F. Lourenço

(The Institute of Statistical Mathematics Tokyo)

Error Bounds and Facial Residual Functions for Conic Linear Programsslides / video


15:30 CET

Mert Pilanci

(Stanford University)

The Hidden Convex Optimization Landscape of Deep Neural Networksslides / video


15:30 CEST

Minh N. Dao

(Federation University Australia)

A Proximal Subgradient Method for Nonsmooth Sum-of-Ratios Optimization Problemsslides / video


15:30 CEST

Shoham Sabach

(Technion Haifa)

Faster Lagrangian-Based Methods in Convex Optimizationslides / video


15:30 CEST

Mathias Staudigl

(Maastricht University)

Generalized Self-Concordant Analysis of Frank-Wolfe Algorithmsslides / video



 How it works

We use zoom, a simple webinar tool for which only the host (University of Vienna in this case) needs a license and all other participants can log-in via a link that will be sent by e-mail together with the room password to the mailing list the day before each talk. Just click the link and fill in the password and you will be sent to the webinar room. There will be a host with control over the microphones.

Some basic rules for participating at the seminar:

  • Please log-in with your name. 
  • There is a group chat. To ask a question, please indicate you would like to ask and your microphone will be turned on. Alternatively, write a question in the chat.
  • You can chat with every participant in a private chat.

 Mailing List

You are kindly invited to join the mailing list on which the next speaker at the One World Optimization Seminar will be announced, and you will receive the access information (link of the zoom-room and the corresponding password) the day before each talk. Please enter your contact information below.

Required fields are marked with a red square
One World Optimization Seminar
This field is required
This field is required: Last name
This field is required
This field is required: First name
This field is required
This field is required: University
This field is required
This field is required: E-mail address
This field is required
This field is required: GDPR
click here to read the » Data Protection Declaration
This field is required
This field is required: Captcha