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...
Saved in:
Main Authors: | , |
---|---|
Format: | article |
Language: | EN |
Published: |
Elsevier
2016
|
Subjects: | |
Online Access: | https://doaj.org/article/24f455963618473180d6a3a1fc22c476 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!