|Start Page Number:||17|
|End Page Number:||41|
|Publication Date:||Jan 2017|
|Journal:||RAIRO - Operations Research|
|Authors:||Mahey Philippe, Lenoir Arnaud|
|Keywords:||programming: convex, heuristics|
Many structured convex minimization problems can be modeled by the search of a zero of the sum of two monotone operators. Operator splitting methods have been designed to decompose and regularize at the same time these kind of models. We review here these models and the classical splitting methods. We focus on the numerical sensitivity of these algorithms with respect to the scaling parameters that drive the regularizing terms, in order to accelerate convergence rates for different classes of models.