Colloquia

A regular colloquium (DK seminar) will be organized in every semester.  This seminar will be attended by the participating members, the PhD students and possibly some outside guests. The organization will be in the hands of the PostDoc. In the first year, the supervisors will give longer introductory lectures about their subjects and will present the research themes. In the following years, the presentations will be given by the PhD students. This seminar will foster the collaboration among supervisors and may lead to joint publications.

 Winter Term 2023

October 20, 2023, from 9.45 to 11.15 am (SR1, Oskar-Morgenstern-Platz 1)
Bo Peng on On Tractable Convex Relaxations of Standard Quadratic Optimization Problems under Sparsity Constraints

November 17, 2023, from 9.45 to 11.15 am (SR1, Oskar-Morgenstern-Platz 1)
Marc Huber on Learning to Select Promising Initial Solutions for Large Neighborhood Search-Based Multi-Agent Path Finding & Jeferson Zapata on On the Relation of Incidence Varieties and Facial Reduction

November 24, 2023, from 9.45 to 11.15 am (SR1, Oskar-Morgenstern-Platz 1)
Lara Ost on Discrete Fréchet Distance and Subtrajectory Clustering

December 1, 2023, from 9.45 to 11.15 am (SR1, Oskar-Morgenstern-Platz 1)
Niklas Hey on On the Computation of Nash Equilibria for Games with Nonconvex Cost

December 15, 2023, from 9.45 to 11.15 am (PC Seminar Room 6, Oskar-Morgenstern-Platz 1)
Mikhail Karapetyants on A Nesterov type algorithm with double Tikhonov regularization: fast convergence of the function values and strong convergence to the minimal norm solution

January 23, 2023, from 9.45 am to 1 pm (SR1, Oskar-Morgenstern-Platz 1)
Beryl Ramadhian Aribowo on 100 energies to learn quantum chemistry (attempts on the QM9 challenge),
Eugenia Iofinova on Practical compression of multimodal CLIP models for accelerated inference &
Tommaso Mannelli Mazzoli on Optimisation and consensus

 Winter Term 2022 - Open Problems Sessions

November 14, 2022, from 1.15 to 2.45 pm (SR6, Oskar-Morgenstern-Platz 1)
Beryl Ramadhian Aribowo, Niklas Hey and Eugenia Iofinova

December 12, 2022, from 1.15 to 2.45 pm (SR12, OMP1)
Jeferson Zapata, Tommaso Mannelli Mazzoli and Lara Ost

January 16, 2022, from 1.15 to 2.45 pm (BZ09, 9th floor, OMP1)
Marc Huber, Mikhail Karapetyants and Bo Peng

 Winter Term 2021

When: Monday, 1.15 pm to 2.45 pm, weekly
Where: Online via Zoom

October 18, 2021 (pls note that this talk will start at 1.30)

• Aleksandr Shevchenko (IST Austria) on Mean-field analysis of training dynamics of neural networks and its applications

October 25, 2021 (pls note that this talk will start at 1 pm)

• Jeferson León Zapata Nieto (IST Austria) on Hybrid and parametric methods in semidefinite programming

November 8, 2021

• Marc Huber (TU Wien) on Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems

November 15, 2021

• Michael Sedlmayer (University of Vienna) on The role of nonsmoothness in convex-concave minimax problems

November 22, 2021

• Bo Peng (University of Vienna) on Conic reformulation for quadratic problems with complementarity
  constraints (QPCCs)

November 29, 2021

• Niklas Hey (Vienna University of Economics and Business) on A solution method for bounded convex set optimization problem
• Beryl Ramadhian Aribowo (University of Vienna) on Potential energy surface of HxOy

December 6, 2021

• David Hulett (University of Vienna) on Continuous-time approaches to monotone inclusions

January 10, 2022

• Wolfgang Ost (University of Vienna) on Differentially Private Algorithms for Graphs Under Continual Observation

January 24, 2022

• Mikhail Karapetyants (University of Vienna) on Fast continuous time approaches for non-smooth convex optimisation

January 31, 2022

• Tommaso Mannelli Mazzoli (TU Wien) on Metaheuristic Algorithms for Bus Driver Scheduling Problem with Complex Break Constraints

 Summer Term 2021

When: Tuesday, 3.00 pm to 4.30 pm, weekly
Where: Online via Zoom

March 9, 2021

• Radu Ioan Boţ (University of Vienna) on Continous and Discrete Time Approaches to Nonsmooth Nonconvex Optimization Problems

March 16, 2021

• Monika Henzinger (University of Vienna) on The Analysis of Static and Dynamic Algorithms

March 23, 2021

• Günther Raidl (TU Wien) on Hybrid Optimization Approaches for Combinatorial Optimization

April 13, 2021

• Arnold Neumaier (University of Vienna) on Interior Point Methods for Quadratic Programs

May 4, 2021

• Birgit Rudloff (Vienna University of Economics and Business) on Set-valued Optimization

May 11, 2021

• Vladimir Kolmogorov (IST Austria) on Discrete Optimization: Complexity, Convex Relaxations and Frank-Wolfe Algorithms
  

May 18, 2021

• Dan Alistarh (IST Austria) on Efficient (Distributed) Algorithms for Machine Learning

June 1, 2021

• Immanuel Bomze (University of Vienna) on Relaxations and Dual Bounds – Tighter with Conic Alternatives
  

June 8, 2021

• Nysret Musliu (TU Wien) on Optimization and AI Techniques for Real-World NP-hard Problems

 Winter Term 2020/2021

When: Thursday, 10.00 am to 11.30 am, biweekly
Where: Online via Zoom

November 10, 2020, 1.00 pm to 3.00 pm (Kick-off Event)

December 3, 2020

• Axel Böhm (University of Vienna) on Nonsmooth Composite Minimization
• Gabriela Kováĉova (Vienna University of Economics and Business) on Convex Projection and Convex Vector Optimization

December 17, 2020

• Morteza Kimiaei (University of Vienna) on Line Search in Noisy Unconstrained Black Box Optimization
• Dang-Khoa Nguyen (University of Vienna) on Factorization of Completely Positive Matrices

January 14, 2021

• Matthias Horn (TU Wien) on Driver Shift Planning for an Online Store with Short Delivery Times
• Marko Djukanovic (TU Wien) on Solving a Generalized Constrained Longest Common Subsequence Problem: Exact and Heuristic Methods

January 28, 2021

• Markus Gabl (University of Vienna) on An introduction to convex reformulations of nonconvex QCQPs
• Jana Hlavinová (Vienna University of Economics and Business) on Elicitability of set-valued functionals (An “inverse optimization problem”)

 Winter Term 2018/2019

When: Wednesday, 11:40 - 12:40
Where: ISOR Meeting Room 6.511 (6th floor), Faculty of Business, Economics and Statistics

24.10.2018

• Nysret Musliu (TU Wien)

31.10.2018

• Martin Glanzer (Uni Wien)

28.11.2018

• Christoph Lampert (IST Austria)

 Summer Term 2018

No colloquium in summer term 2018.

 Winter Term 2017/18

When: Wednesday, 11:30 - 12:30
Where: ISOR Meeting Room 6.511 (6th floor), Faculty of Business, Economics and Statistics

18.10.2017

• Marko Djukanovic (TUW, Institute of Computer Graphics and Algorithms): Exact and heuristic algorithms for solving the Longest common palindromic subsequence problem

25.10.2017

• Matthias Horn (TUW, Institute of Computer Graphics and Algorithm): Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment

08.11.2017

• Gramoz Goranci (UW, Faculty of Computer Science): On Reachability Vertex Sparsifiers

15.11.2017

• Dennis Meier (UW, Faculty of Mathematics): ADMM for monotone operators

22.11.2017

• Vladimir Kolmogorov (IST Austria): Complexity classifications of Valued Constraint Satisfaction Problems (Abstract)

06.12.2017

• Birgit Rudloff (WU, Institute for Statistics and Mathematics): Dynamic programming for multivariate problems involving risk measures (Abstract)

13.12.2017

• Caroline Geiersbach (UW, Department of Statistics and OR): Projected Stochastic Gradient Descent in Hilbert Spaces

24.01.2018

• Georg Pflug (UW, Department of Statistics and OR)

31.01.2018

• Hermann Schichl (UW, Faculty of Mathematics)

UW = University of Vienna
TUW = TU Wien
WU = Vienna University of Economics and Business
IST = Institute of Science and Technology Austria

 Summer Term 2017

When: Wednesday, 13:30 - 15:00
Where: ISOR Meeting Room 6.511 (6th floor), Faculty of Business, Economics and Statistics

22.03.2017

• Teresa Scarinci (UW, Department of Statistics and OR): On high order time-discretization schemes in optimal control problems with bang-bang solutions

05.04.2017

• Immanuel Bomze (UW, Department of Statistics and OR): The complexity of simple models - a study of worst and typical hard cases for the Standard Quadratic Problem (StQP)
• Georg Pflug (UW, Department of Statistics and OR): Introduction to Stochastic Optimization
  

03.05.2017

• Arnold Neumaier (UW, Department of Mathematics): Constraint aggegation in global optimization
• Hermann Schichl (UW, Department of Mathematics): Recent developments in global optimization

07.06.2017

• Radu Ioan Bot (UW, Department of Mathematics): The proximal-gradient algorithm for fractional programming: convergence analysis and rates
• Guenther Raidl (TUW, Institute of Computer Graphics and Algorithms): Mixed Integer Programming Approaches for Resource-Constrained Project Scheduling
  

14.06.2017

• Radu Ioan Bot (UW, Department of Mathematics): The primal-dual Douglas-Rachford algorithm for nonsmooth convex optimization
• Monika Henzinger (UW, Department of Computer Science): An Introduction to the Analysis of Combinatorial Algorithms

 Winter Term 2016/17

When: Wednesday, 15:00 - 17:00
Where: Seminar Room 3.307 (3rd floor), Faculty of Business, Economics and Statistics

16.11.2016

• Stefan Neu­mann (UW, Department of Computer Science): What You Will Gain By Rounding: Theory and Algorithms for Rounding Rank

23.11.2016

• Gramoz Goranci (UW, Department of Computer Science): Oblivious Routing beyond L_p norms

30.11.2016

• Caroline Geiersbach (UW, Department of Statistics and OR): Stochastic Homogenization in Elliptic Partial Differential Equations: Error Estimates and Optimal Approaches

07.12.2016

• Axel Böhm (UW, Department of Mathematics): The Viability Kernel Algorithm

14.12.2016

• Dang Khoa Nguyen (UW, Department of Mathematics): Splitting algorithms for monotone inclusions

18.01.2017

• Markus Gabl (UW, Department of Statistics and OR): Quadratic and Robust Programming

25.01.2017

• Morteza Kimiaei (UW, Department of Mathematics): Some algorithms for solving box constrained optimization