Title
A parallel block-coordinate approach for primal-dual splitting with arbitrary random block selection
Abstract
The solution of many applied problems relies on finding the minimizer of a sum of smooth and/or nonsmooth convex functions possibly involving linear operators. In the last years, primal-dual methods have shown their efficiency to solve such minimization problems, their main advantage being their ability to deal with linear operators with no need to invert them. However, when the problem size becomes increasingly large, the implementation of these algorithms can be complicated, due to memory limitation issues. A simple way to overcome this difficulty consists of splitting the original numerous variables into blocks of smaller dimension, corresponding to the available memory, and to process them separately. In this paper we propose a random block-coordinate primal-dual algorithm, converging almost surely to a solution to the considered minimization problem. Moreover, an application to large-size 3D mesh denoising is provided to show the numerical efficiency of our method.
Year
Venue
Keywords
2015
European Signal Processing Conference
convex optimization,nonsmooth optimization,primal-dual algorithm,stochastic algorithm,parallel algorithm,random block-coordinate approach,proximity operator,mesh denoising
Field
DocType
ISSN
Convergence (routing),Mathematical optimization,Polygon mesh,Parallel algorithm,Minification,Convex function,Operator (computer programming),Almost surely,Convex optimization,Mathematics
Conference
2076-1465
Citations 
PageRank 
References 
1
0.35
17
Authors
3
Name
Order
Citations
PageRank
Audrey Repetti1766.84
Emilie Chouzenoux220226.37
Jean-Christophe Pesquet356046.10