Workshop: Cones by the lake, Uncertain QCQPs (2026)

privatfotoFrom July 1 to 3, 2026, researchers from the FWF-funded project Uncertain QCQP and fellow experts gathered at Alpen-Adria-Universität Klagenfurt.
The workshop focused on innovative conic approaches for solving nonconvex quadratic optimization problems with uncertainty. The presentations sparked lively discussions, opening new research avenues and providing valuable feedback, especially for early-career researchers.
Academic Program

  • Polynomial Optimization & Symmetry: Johannes Schmucker and Daniel Brosch presented methods that exploit symmetry and term sparsity (including a method for computing an upper bound for the Ramsey number R(6,6)).
  • Conic Duality: Immanuel Bomze introduced purely algebraic arguments regarding attainability in simplicial quadratic optimization problems.
  • Graph Problems & SDP: Angelika Wiegele demonstrated an integer SDP formulation for the Quadratic Minimum Spanning Tree Problem, along with a corresponding solution algorithm.
  • Copositive Programming: Johannes Zischg and Markus Gabl discussed adjustable robust optimization problems and specific solution algorithms.
  • Hierarchies for Max-Cut: Franz Rendl explored the mathematical relationships between the Lasserre hierarchy and the exact subgraph hierarchy.

Networking & Social Program
Beyond the intensive scientific program, the workshop offered plenty of opportunities for personal exchange. The first two days concluded with a dinner and a refreshing swim at beautiful Lake Wörthersee. On the third day, the event wrapped up with a scenic hike to the Kosiak mountain and the Klagenfurter Hütte.
Participants: Immanuel Bomze, Daniel Brosch, Markus Gabl, Franz Rendl, Johannes Schmucker, Angelika Wiegele, Johannes Zischg.

#top .avia-gallery.av-iin51v-cf7ccb87800ff1ca1ef5de58b270eaff .avia-gallery-thumb a{
width:20%;
}


Der Beitrag Workshop: Cones by the lake, Uncertain QCQPs (2026) erschien zuerst auf University of Klagenfurt.