Monday 30 November
Tuesday 1 December
Wednesday 2 December
Thursday 3 December
Friday 4 December
Monday 30 November 2020
Please proceed to slack to watch the memorial session videos.
Pre-recorded videos
Willi Weber
Joydeep Dutta
Marco Lopez
Michel Théra
Andrew Eberhard: Abstract Convexity and Alex Rubinov
30 November 2020, 1pm
Regina Burachik: Abstract Convexity and Zero Duality Gap
30 November 2020, 2pm
Vera Roshchina: Quasidifferentials: the old and the new
30 November 2020, 2:30pm
Interview with Lyudmila Polyakova
30 November 2020, 3pm
Nadia Sukhorukova & Julien Ugon: Quasidifferentiability and free knot spline approximation
30 November 2020, 3:30pm
Tuesday 1 December 2020
Morning Session
Gabriel Haeser: A new look at classical constraint qualifications for conic programming
Jane Ye: Second-order optimality conditions for non-convex set-constrained optimization problem
Fusheng Bai: Surrogate Optimization for Computationally Expensive Black-box Functions
Lindon Roberts: Scalable Derivative-Free Optimization for Nonlinear Least-Squares Problems
Hoa Bui: Necessary Conditions for Non-Intersection of Collections of Sets
Bruno Lourenço: Spectral functions and an apology of Jordan Algebras
Evening Session
Marco A. López-Cerdá: New representations of the normal cone to the domain of supremum functions and subdifferential calculus
Elisabeth Köbis: Approaches to Set Optimization in Real Linear Spaces Without Convexity Assumptions
Krzysztof Rutkowski: On autonomous ODE corresponding to Haugazeau’s algorithm
Monika Syga: Lagrangian duality for abstract convex functions
Krzysztof Leśniewski: On tangent cone to systems of inequalities and equations in Banach spaces under RCRC
Wednesday 2 December 2020
Morning Session
Asen Dontchev: Teaching and Advertising Variational Analysis
Matthew Tam: Gearhart–Koshy acceleration for affine subspaces
Nam Ho-Nguyen: Distributionally Robust Chance-Constrained Programs under Wasserstein Ambiguity
Scott B Lindstrom: Computable Centering Methods for Spiraling Algorithms and their Duals, with Motivations from the Theory of Lyapunov Functions
Xiaoqi Yang: Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis
Evening session
Didier Henrion: Polynomial optimization with the Lasserre hierarchy
Radek Cibulka: Ranges of nonlinear operators
Nir Sharon: Multiscale transform for scattered manifold-valued data
Patrick Mehlitz: Asymptotic regularity in nonsmooth mathematical programming
Constantin Zalinescu: On unconstrained optimization problems solved using CDT and triality theory
Thursday 3 December 2020
Morning Session
Claudia Sagastizábal: Exploiting structure in nonsmooth optimization: past and present
Dmitriy Drusvyatskiy: Active strict saddles in nonsmooth optimization
Chayne Planiden: New Gradient and Hessian Approximation Methods for Derivative-free Optimisation
Vinesha Peiris: The extension of linear inequality method for generalised rational Chebyshev approximation
David Yost: Diametrally maximal sets
Afternoon session
Note that Hong-Kun Xu's talk was moved to Friday 11am
Pradeep Kumar Sharma: Levitin-Polyak well-posedness for set optimization problems
Joydeep Dutta: A simple algorithm for simple bilevel programming
Night Session
Didier Henrion: Solving numerically polynomial optimization problems
Evgeni Nurminski: Additional Cuts in Conjugate Epi-Projection Algorithm
Alexander Zaslavski: A turnpike property of trajectories of dynamical systems with a Lyapunov function
Christiane Tammer: Necessary optimality conditions in generalized convex vector optimization involving nonconvex constraints
Andrei Dmitruk: Lagrange Multipliers Rule for a General Extremum Problem with an Infinite Number of Constraints
Friday 4 December
Morning Session
Claudia Sagastizábal: Exploiting structure in nonsmooth optimization: present and future
Yalçın Kaya: Path planning via maximum-information control
Minh Dao: Proximal subgradient algorithms for nonconvex nonsmooth fractional programming
Hong-Kun Xu: Convergence Analysis of the Frank-Wolfe Algorithm for Convex and Nonconvex Optimization
For those who didn't make it to slack, here's an interview with Marguerite Frank posted by Matthew Tam: https://www.youtube.com/watch?v=24e08AX9Eww.