Convexity and Non-Convexity in Partitioning and Interpolation Problems

Jan Lellmann
University of Cambridge
Department of Applied Mathematics and Theoretical Physics

We give an overview over recent developments on provably optimal relaxation of partitioning problems and on important implementation aspects. Moreover we present some new results on using non-convex higher-order regularization for a special class of interpolation problems.

Back to Convex Relaxation Methods for Geometric Problems in Scientific Computing