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
Will appear soon...
?
?
?Programm
The workshop will start on Monday, February 23, in the afternoon and will end on Wednesday, February 25, noon. The detailed schedule will appear later.
