A note on alternating minimization algorithms: Bregman frame
Lists
Only you see this
Abstract
In this paper, we propose a Bregman frame for several classical alternating minimization algorithms. In the frame, these algorithms have uniform mathematical formulation. We also present convergence analysis for the frame algorithm. Under the Kurdyka-Lojasiewicz property, stronger convergence is obtained.
BibTeX
@misc{sun2016note,
author = {Tao Sun and Lizhi Cheng},
title = {{A note on alternating minimization algorithms: Bregman frame}},
year = {2016},
eprint = {1605.08290},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/1605.08290},
}Loading related content...