A Primal–Dual Splitting Method for Convex Optimization Involving Lipschitzian, Proximable and Linear Composite Terms |
| |
Authors: | Laurent Condat |
| |
Institution: | 1. GIPSA-Lab, CNRS—Grenoble Institute of Technology, 11 rue des Mathématiques, Campus BP46, 38402, St. Martin d’Hères Cedex, France
|
| |
Abstract: | We propose a new first-order splitting algorithm for solving jointly the primal and dual formulations of large-scale convex minimization problems involving the sum of a smooth function with Lipschitzian gradient, a nonsmooth proximable function, and linear composite functions. This is a full splitting approach, in the sense that the gradient and the linear operators involved are applied explicitly without any inversion, while the nonsmooth functions are processed individually via their proximity operators. This work brings together and notably extends several classical splitting schemes, like the forward–backward and Douglas–Rachford methods, as well as the recent primal–dual method of Chambolle and Pock designed for problems with linear composite terms. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|