期刊
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
卷 29, 期 4, 页码 1120-1146出版社
SIAM PUBLICATIONS
DOI: 10.1137/060649021
关键词
matrix nearness problems; Bregman divergences; squared Euclidean distance; relative entropy; alternating projections
This paper discusses a new class of matrix nearness problems that measure approximation error using a directed distance measure called a Bregman divergence. Bregman divergences offer an important generalization of the squared Frobenius norm and relative entropy, and they all share fundamental geometric properties. In addition, these divergences are intimately connected with exponential families of probability distributions. Therefore, it is natural to study matrix approximation problems with respect to Bregman divergences. This article proposes a framework for studying these problems, discusses some specific matrix nearness problems, and provides algorithms for solving them numerically. These algorithms apply to many classical and novel problems, and they admit a striking geometric interpretation.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据