Exact Relaxation for Classes of Minimization Problems with Binary Constraints
From MaRDI portal
Publication:6236728
arXiv1210.7507MaRDI QIDQ6236728FDOQ6236728
Authors: Martin Burger, Yiqiu Dong, Michael Hintermüller 
Publication date: 28 October 2012
Abstract: Relying on the co-area formula, an exact relaxation framework for minimizing objectives involving the total variation of a binary valued function (of bounded variation) is presented. The underlying problem class covers many important applications ranging from binary image restoration, segmentation, minimal compliance topology optimization to the optimal design of composite membranes and many more. The relaxation approach turns the binary constraint into a box constraint. It is shown that thresholding a solution of the relaxed problem almost surely yields a solution of the original binary-valued problem. Furthermore, stability of solutions under data perturbations is studied, and, for applications such as structure optimization, the inclusion of volume constraints is considered. For the efficient numerical solution of the relaxed problem, a locally superlinearly convergent algorithm is proposed which is based on an exact penalization technique, Fenchel duality, and a semismooth Newton approach. The paper ends by a report on numerical results for several applications in particular in mathematical image processing.
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Numerical methods involving duality (49M29) Numerical methods of relaxation type (49M20)
This page was built for publication: Exact Relaxation for Classes of Minimization Problems with Binary Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6236728)
