A variable smoothing algorithm for solving convex optimization problems
Preprint
Abstract
In this article we propose a method for solving unconstrained optimization problems with convex and Lipschitz continuous objective functions. By making use of the Moreau envelopes of the functions occurring in the objective, we smooth the latter to a convex and differentiable function with Lipschitz continuous gradient by using both variable and constant smoothing parameters. The resulting problem is solved via an accelerated first-order method and this allows us to recover approximately the optimal solutions to the initial optimization problem with a rate of convergence of order $\O(\tfrac{\ln k}{k})$ for variable smoothing and of order $\O(\tfrac{1}{k})$ for constant smoothing. Some numerical experiments employing the variable smoothing method in image processing and in supervised learning classification are also presented.
Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- On the acceleration of the double smoothing technique for unconstrained convex optimization problemsOptimization, 2012
- A double smoothing technique for solving unconstrained nondifferentiable convex optimization problemsComputational Optimization and Applications, 2012
- A Monotone+Skew Splitting Model for Composite Monotone Inclusions in DualitySIAM Journal on Optimization, 2011
- Optimization problems in statistical learning: Duality and optimality conditionsEuropean Journal of Operational Research, 2011
- Primal-Dual Splitting Algorithm for Solving Inclusions with Mixtures of Composite, Lipschitzian, and Parallel-Sum Type Monotone OperatorsSet-Valued and Variational Analysis, 2011
- A First-Order Primal-Dual Algorithm for Convex Problems with Applications to ImagingJournal of Mathematical Imaging and Vision, 2010
- Convex Functions: Constructions, Characterizations and Counterexamples2009
- Combining a Filter Method with SVMs2008
- Smoothing Technique and its Applications in Semidefinite OptimizationMathematical Programming, 2006
- Smooth minimization of non-smooth functionsMathematical Programming, 2004