On the acceleration of the double smoothing technique for unconstrained convex optimization problems
- 14 December 2012
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 64 (2) , 265-288
Abstract
In this article, we investigate the possibilities of accelerating the double smoothing (DS) technique when solving unconstrained nondifferentiable convex optimization problems. This approach relies on the regularization in two steps of the Fenchel dual problem associated with the problem to be solved into an optimization problem having a differentiable strongly convex objective function with Lipschitz continuous gradient. The doubly regularized dual problem is then solved via a fast gradient method. The aim of this article is to show how the properties of the functions in the objective of the primal problem influence the implementation of the DS approach and its rate of convergence. The theoretical results are applied to linear inverse problems by making use of different regularization functionals.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Iterative regularization with a general penalty term—theory and application toL1andTVregularizationInverse Problems, 2012
- Double Smoothing Technique for Large-Scale Linearly Constrained Convex OptimizationSIAM Journal on Optimization, 2012
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse ProblemsSIAM Journal on Imaging Sciences, 2009
- Duality in Vector Optimization2009
- Smoothing Technique and its Applications in Semidefinite OptimizationMathematical Programming, 2006
- Excessive Gap Technique in Nonsmooth Convex MinimizationSIAM Journal on Optimization, 2005
- Smooth minimization of non-smooth functionsMathematical Programming, 2004
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraintCommunications on Pure and Applied Mathematics, 2004
- Introductory Lectures on Convex Optimization2004
- Perturbation Analysis of Optimization Problems2000