Non-smooth Non-convex Bregman Minimization: Unification and New Algorithms

We propose a unifying algorithm for non-smooth non-convex optimization. The algorithm approximates the objective function by a convex model function and finds an approximate (Bregman) proximal point of the convex model. This approximate minimizer of the model function yields a descent direction, alo...

Ausführliche Beschreibung