On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems
arXiv:1303.2875
Abstract
We present two modified versions of the primal-dual splitting algorithm relying on forward-backward splitting proposed in \cite{vu} for solving monotone inclusion problems. Under strong monotonicity assumptions for some of the operators involved we obtain for the sequences of iterates that approach the solution orders of convergence of O(1/n) and O(ω^n), for , respectively. The investigated primal-dual algorithms are fully decomposable, in the sense that the operators are processed individually at each iteration. We also discuss the modified algorithms in the context of convex optimization problems and present numerical experiments in image processing and support vector machines classification.
arXiv comment24 pages
References in corpus (5)
- Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization
- A Douglas-Rachford type primal-dual method for solving inclusions with mixtures of composite and parallel-sum type monotone operators
- A primal-dual splitting algorithm for finding zeros of sums of maximally monotone operators
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- A variable smoothing algorithm for solving convex optimization problems