拉斯维加斯赌城

图片

Workshop on Relaxation Methods in Optimization

University of Augsburg, February 23-25, 2026

The idea of relaxation is one of the common themes across several branches of both discrete and continuous optimization. Typical examples include replacing nonconvex by convex, discrete by continuous or underdetermined by regularized problems. In a broad perspective, relaxation often enables the theoretical treatment of an optimization problem as well as the design of efficient algorithms for its numerical solution. The goal of this workshop is to discuss recent results and developments on several aspects of relaxation methods and foster interaction between different optimization communities?based on this common perspective.

?

Speakers

  • Miguel Anjos??? (University of Edinburgh)
  • Immanuel Bomze??? (University of Vienna)
  • Christoph?Buchheim??? (TU Dortmund)
  • Etienne De Klerk??? (Tilburg University)
  • Gabriele Eichfelder??? (TU Ilmenau)
  • Anja Fischer??? (TU Dortmund)
  • Markus Gabl??? (University of Vienna)
  • Jan Kronqvist??? (KTH Royal Institute of Technology)
  • Sven Mallach??? (University of Siegen)
  • Oleh Melnyk ? (TU Berlin)
  • Tim Netzer??? (University of Innsbruck)
  • Stefania Petra??? (Heidelberg University)
  • Marc Pfetsch ? ?(TU Darmstadt)
  • Markus Sinnl??? (JKU Linz)
  • Dominik St?ger??? (KU Eichst?tt-Ingolstadt)
  • Frank Vallentin??? (University of Cologne)
  • Stefan Weltge??? (TU Munich)
  • Angelika Wiegele??? (University of Klagenfurt)
?

Program

The workshop will start on Monday, February 23, in the afternoon and will end on Wednesday, February 25, noon. The tentative schedule is available? here.

?

?

Organizers

  • Elisabeth Gaar (University of Augsburg)
  • André Uschmajew (University of Augsburg)

?

Contact

rmo2026@math.uni-augsburg.de

?

?

Search