The cookie-related information is fully under our control. These cookies are not used for any purpose other than those described here. Unibo policy
There is an increasing interest in block regularized nonconvex nonsmooth optimization. We introduce an approach that effectively exploits the structure of the problem and enables complex application-dependent regularization to be used. The proposed ASAP algorithm enjoys simple explicit updates. Global convergence to a critical point is proved using the Kurdyka-Lojasiewicz property. We also prove that a large class of useful objective functions satisfy this property. Applications of ASAP to various imaging problems are presented.
This presentation is part of Minisymposium “MS37 - Sparse-based techniques in variational image processing (2 parts)”
organized by: Serena Morigi (Dept. Mathematics, University of Bologna) , Ivan Selesnick (New York University) , Alessandro Lanza (Dept. Mathematics, University of Bologna) .