International audienceA wide array of image recovery problems can be abstracted into theproblem of minimizing a sum of composite convex functions in aHilbert space. To solve such problems, primal-dual proximalapproaches have been developed which provide efficient solutions tolarge-scale optimization problems. Theobjective of this paper is to show that a number of existingalgorithms can be derived from a general form of theforward-backward algorithm applied in a suitable product space.Our approach also allows us to develop useful extensions ofexisting algorithms by introducing a variable metric. Anillustration to image restoration is provided
We consider a variational formulation of blind image recov-ery problems. A novel iterative proximal ...
This thesis is concerned with the development of novel numerical methods for solving nondifferentiab...
This thesis focuses on two topics in the field of convex optimization: preprocessing algorithms for ...
International audienceA wide array of image recovery problems can be abstracted into theproblem of m...
An efficient approach for solving an inverse problem is to define the recovered signal/image as a mi...
We study a first-order primal-dual algorithm for convex optimization problems with known saddle-poin...
This paper presents a multilevel framework for inertial and inexact proximal algorithms, that encomp...
Optimization methods are at the core of many problems in signal/image processing, computer vision, a...
International audienceOptimization methods are at the core of many problems in signal/image processi...
We propose a nested primal–dual algorithm with extrapolation on the primal variable suited for mini...
International audienceStochastic approximation techniques have been used in various contexts in data...
Non-euclidean versions of some primal-dual iterative optimization algorithms are presented. In these...
We present a primal-dual algorithmic framework to obtain approximate solutions to a prototypical con...
Une approche efficace pour la résolution de problèmes inverses consiste à définir le signal (ou l'im...
(34 pp.) arXiv:0806.3920International audienceThe objective of this paper is to develop methods for ...
We consider a variational formulation of blind image recov-ery problems. A novel iterative proximal ...
This thesis is concerned with the development of novel numerical methods for solving nondifferentiab...
This thesis focuses on two topics in the field of convex optimization: preprocessing algorithms for ...
International audienceA wide array of image recovery problems can be abstracted into theproblem of m...
An efficient approach for solving an inverse problem is to define the recovered signal/image as a mi...
We study a first-order primal-dual algorithm for convex optimization problems with known saddle-poin...
This paper presents a multilevel framework for inertial and inexact proximal algorithms, that encomp...
Optimization methods are at the core of many problems in signal/image processing, computer vision, a...
International audienceOptimization methods are at the core of many problems in signal/image processi...
We propose a nested primal–dual algorithm with extrapolation on the primal variable suited for mini...
International audienceStochastic approximation techniques have been used in various contexts in data...
Non-euclidean versions of some primal-dual iterative optimization algorithms are presented. In these...
We present a primal-dual algorithmic framework to obtain approximate solutions to a prototypical con...
Une approche efficace pour la résolution de problèmes inverses consiste à définir le signal (ou l'im...
(34 pp.) arXiv:0806.3920International audienceThe objective of this paper is to develop methods for ...
We consider a variational formulation of blind image recov-ery problems. A novel iterative proximal ...
This thesis is concerned with the development of novel numerical methods for solving nondifferentiab...
This thesis focuses on two topics in the field of convex optimization: preprocessing algorithms for ...