Program
Location: University of Augsburg, building T, room HS 1004
Date: February 23-25, 2026
|
Monday, February 23 |
|
|
13:30 - 13:45 |
Welcome |
|
13:45 - 14:15 |
Etienne De Klerk (Tilburg University) On Lasserre hierarchies for polynomial optimization on the hypercube |
|
14:15 - 14:45 |
Anja Fischer (TU Dortmund) Strong relaxations for two variants of the quadratic minimum arborescence problem |
|
14:45 - 15:15 |
Stefan Weltge (TU Munich) Multiplicative assignment with upgrades |
|
15:15 - 16:00 |
Coffee break |
|
16:00 - 16:30 |
Frank Vallentin (University of Cologne) On the computational complexity of SOS |
|
16:30 - 17:00 |
Jan Kronqvist (KTH Royal Institute of Technology) Exploring affine and rotational transformations to strengthen relaxations for non-convex quadratic problems |
|
17:00 - 17:30 |
Tim Netzer (University of Innsbruck) Geometric foundations of semidefinite programming and a new homotopy method |
|
Tuesday, February 24 |
|
|
09:30 - 10:00 |
Angelika Wiegele (University of Klagenfurt) Bounds on the Edge Expansion by Relaxing a Completely Positive Program |
|
10:00 - 10:30 |
Marc Pfetsch (TU Darmstadt) Solving Mixed-Integer SDPs via LP- or SDP-based Approaches |
|
10:30 - 11:00 |
Coffee break |
|
11:00 - 11:30 |
Immanuel Bomze (University of Vienna) Copositivity-informed relaxations of rigorous sparsity control in StQPs applied to microfinance |
|
11:30 - 12:00 |
Oleh Melnyk (TU Berlin) Stochastic Zeroth-Order Method for Computing Generalized Rayleigh Quotients |
|
12:00 - 13:30 |
Lunch |
|
13:30 - 14:00 |
Christoph Buchheim (TU Dortmund) Convex relaxations and dual bounds in function space |
|
14:00 - 14:30 |
Stefania Petra (Heidelberg University) Multilevel Bregman Proximal Gradient Descent |
|
14:30 - 15:00 |
Sven Mallach (University of Siegen) Linear and Semidefinite Programming Perspectives on Quadratic Ordering Problems |
|
15:00 - 15:30 |
Coffee break |
|
16:30 - 18:30 |
|
|
18:30 |
Conference dinner (self pay) |
|
Wednesday, February 25 |
|
|
09:30 - 10:00 |
Miguel F. Anjos (University of Edinburgh) Unboundedness in Bilevel Optimization |
| 10:00 - 10:30 |
Markus Gabl (University of Vienna) Completely positive reformulations for sparse quadratic optimization |
|
10:30 - 11:00 |
Coffee break |
|
11:00 - 11:30 |
Gabriele Eichfelder (TU Ilmenau) Conic relaxations for multiobjective optimization problems |
|
11:30 - 12:00 |
Markus Sinnl (JKU Linz) On solving integer bilevel problems using the high point relaxation and cuts |
|
12:00 - 12:30 |
Dominik Stöger (KU Eichstätt-Ingolstadt) Iteratively Reweighted Least Squares in Low-Rank Optimization with Linear Con- vergence Rate |
|
12:30 - 13:30 |
Lunch |