Tuesday, 13:45 - 14:10 h, Room: H 1012


Christopher Hendrich
A double smoothing technique for solving nondifferentiable convex optimization problems

Coauthor: Radu I. Bot


The aim of this talk is to develop an efficient algorithm for solving a class of unconstrained nondifferentiable convex optimization problems. To this end we formulate first its Fenchel dual problem and regularize it in two steps into a differentiable strongly convex one with Lipschitz continuous gradient. The doubly regularized dual problem is then solved via a fast gradient method with the aim of accelerating the resulting convergence scheme.


Talk 2 of the invited session Tue.2.H 1012
"Nonsmooth optimization methods" [...]
Cluster 17
"Nonsmooth optimization" [...]


  There are three major facts that should be watched out for in all payday loans in the United States. Thanks to that, they have a great variety of drugs that can help in these cases. Female Viagra is not an exception.