A variable smoothing algorithm for solving convex optimization problems

@inproceedings{Bo2012AVS,
  title={A variable smoothing algorithm for solving convex optimization problems},
  author={Radu Ioan Boţ and Christopher Hendrich},
  year={2012}
}
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… CONTINUE READING
9 Citations
18 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Convex Analysis and Monotone Operator Theory in Hilbert Spaces

  • H. H. Bauschke, P. L. Combettes
  • CMS Books in Mathematics,
  • 2011
1 Excerpt

Conjugate Duality in Convex Optimization

  • R. I. Boţ
  • Lecture Notes in Economics and Mathematical…
  • 2010
2 Excerpts

Similar Papers

Loading similar papers…