Backward-Backward Splitting in Hadamard Spaces
Optimization and Control
2013-10-01 v2 Metric Geometry
Abstract
The backward-backward algorithm is a tool for finding minima of a regularization of the sum of two convex functions in Hilbert spaces. We generalize this setting to Hadamard spaces and prove the convergence of an error-tolerant version of the backward-backward method.
Cite
@article{arxiv.1309.5884,
title = {Backward-Backward Splitting in Hadamard Spaces},
author = {Sebastian Banert},
journal= {arXiv preprint arXiv:1309.5884},
year = {2013}
}