Resumen de A variable smoothing algorithm for solving convex optimization problems
Radu Ioan Bot, Christopher Hendrich
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 them to convex and differentiable functions with Lipschitz continuous gradients 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(lnkk) for variable smoothing and of order O(1k) for constant smoothing. Some numerical experiments employing the variable smoothing method in image processing and in supervised learning classification are also presented.
