A note on alternating minimization algorithms: Bregman frame

Tao Sun; Lizhi Cheng

A note on alternating minimization algorithms: Bregman frame

Numerical Analysis 2016-05-27 v1

Authors: Tao Sun , Lizhi Cheng

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.

Keywords

randomized kaczmarz algorithm matrix algorithms frame theory

Cite

@article{arxiv.1605.08290,
  title  = {A note on alternating minimization algorithms: Bregman frame},
  author = {Tao Sun and Lizhi Cheng},
  journal= {arXiv preprint arXiv:1605.08290},
  year   = {2016}
}

Related papers

View all related →