https://link.springer.com/collections/adbchhgcfg
Dear colleagues,
we are happy to announce a special issue on relaxation methods in
optimization in Mathematical Methods of Operations Research
succeeding our Workshop on Relaxation Methods in Optimization at the
University of Augsburg, Germany. The submission deadline is December 31,
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. Thus, relaxation methods are one of the key principles in
mathematical optimization.
The goal of this special issue is to gather recent results and
developments on several aspects of relaxation methods, including theory,
methodologies and applications of
*) Linear relaxations
*) Quadratic relaxations
*) Second-order cone relaxations
*) Semidefinite relaxations
*) Conic relaxations
*) Convex relaxation
*) Continuous relaxation
*) Regularization
*) Relaxation hierarchies
*) Strengthening relaxations.
Details can be found under [1]. We are looking forward to receiving your
excellent submissions.
Best,
Elisabeth Gaar and André Uschmajew
--
Prof. Dr. Elisabeth Gaar
Institute of Mathematics
University of Augsburg
86135 Augsburg, Germany