1689. A unifiying graph-based analysis of projection algorithms for linear subspaces
Invited abstract in session MC-50: Splitting algorithms, stream Variational analysis, equilibria and nonsmooth optimization.
Monday, 12:30-14:00Room: Parkinson B11
Authors (first author is the speaker)
| 1. | César López Pastor
|
| Mathematics, Universidad de Alicante | |
| 2. | Francisco Javier Aragón Artacho
|
| Mathematics, University of Alicante | |
| 3. | Rubén Campoy
|
| Department of Mathematics, Universidad de Alicante |
Abstract
This work develops a general analysis for the fixed points of the operators defining the graph splitting methods by Bredies, Chenchene and Naldi. We particularize it to the case of projection algorithms for closed linear subspaces and provide an explicit formula for the limit points of the graph splitting schemes. We exemplify these results on some particular algorithms, unifying in this way some results previously derived as well as obtaining new ones. This is a joint work with Francisco J. Aragón Artacho, Heinz H. Bauschke and Rubén Campoy.
Keywords
- Algorithms
Status: accepted
Back to the list of papers