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
This thesis focuses on two topics in the field of convex optimization: preprocessing algorithms for ...
In the solution of inverse problems, the objective is often to minimize the sum of two convex functi...
This thesis is concerned with the development of novel numerical methods for solving nondifferentiab...
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...
International audienceOptimization methods are at the core of many problems in signal/image processi...
Optimization methods are at the core of many problems in signal/image processing, computer vision, a...
This paper presents a multilevel framework for inertial and inexact proximal algorithms, that encomp...
International audienceMost optimization problems arising in imaging science involve high-dimensional...
Non-euclidean versions of some primal-dual iterative optimization algorithms are presented. In these...
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...
We present a primal-dual algorithmic framework to obtain approximate solutions to a prototypical con...
This thesis focuses on two topics in the field of convex optimization: preprocessing algorithms for ...
In the solution of inverse problems, the objective is often to minimize the sum of two convex functi...
This thesis is concerned with the development of novel numerical methods for solving nondifferentiab...
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...
International audienceOptimization methods are at the core of many problems in signal/image processi...
Optimization methods are at the core of many problems in signal/image processing, computer vision, a...
This paper presents a multilevel framework for inertial and inexact proximal algorithms, that encomp...
International audienceMost optimization problems arising in imaging science involve high-dimensional...
Non-euclidean versions of some primal-dual iterative optimization algorithms are presented. In these...
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...
We present a primal-dual algorithmic framework to obtain approximate solutions to a prototypical con...
This thesis focuses on two topics in the field of convex optimization: preprocessing algorithms for ...
In the solution of inverse problems, the objective is often to minimize the sum of two convex functi...
This thesis is concerned with the development of novel numerical methods for solving nondifferentiab...