On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems

We analyze the proximal alternating linearized minimization algorithm (PALM) for solving non-smooth convex minimization problems where the objective function is a sum of a smooth convex function and block separable non-smooth extended real-valued convex functions. We prove a global non-asymptotic su...

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux: Ron Shefi, Marc Teboulle
Format: article
Langue:EN
Publié: Elsevier 2016
Sujets:
Accès en ligne:https://doaj.org/article/24f455963618473180d6a3a1fc22c476
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!