Matrix Nearness Problems with Bregman Divergences

DOI10.1137/060649021zbMath1153.65044OpenAlexW2022416612WikidataQ59750771 ScholiaQ59750771MaRDI QIDQ3537440

Joel A. Tropp, Inderjit S. Dhillon

Publication date: 6 November 2008

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://authors.library.caltech.edu/9428/

zbMATH Keywords

algorithmsrelative entropynumerical examplesalternating projectionsBregman divergencesmatrix nearness problemssquared Euclidean distance

Mathematics Subject Classification ID

Related Items (29)

Covariance structure regularization via entropy loss function ⋮ Multivariate GARCH estimation via a Bregman-proximal trust-region method ⋮ Optimal Bayesian minimax rates for unconstrained large covariance matrices ⋮ A Unified Framework for Structured Graph Learning via Spectral Constraints ⋮ Information geometry of operator scaling ⋮ Estimation and empirical performance of non-scalar dynamic conditional correlation models ⋮ Correlation structure regularization via entropy loss function for high-dimension and low-sample-size data ⋮ Geometry preserving multi-task metric learning ⋮ Computing the threshold of the influence of intercellular nanotubes on cell-to-cell communication integrity ⋮ New Bregman proximal type algoritms for solving DC optimization problems ⋮ Right mean for the \(\alpha - z\) Bures-Wasserstein quantum divergence ⋮ The method of randomized Bregman projections for stochastic feasibility problems ⋮ Likelihood Geometry of Correlation Models ⋮ Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method ⋮ Generalization of clustering agreements and distances for overlapping clusters and network communities ⋮ A Bregman extension of quasi-Newton updates. II: Analysis of robustness properties ⋮ From joint convexity of quantum relative entropy to a concavity theorem of Lieb ⋮ Averaging Symmetric Positive-Definite Matrices ⋮ A Bregman extension of quasi-Newton updates I: an information geometrical framework ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming ⋮ Optimal rates of convergence for sparse covariance matrix estimation ⋮ Geodesically Parameterized Covariance Estimation ⋮ Matrix versions of the Hellinger distance ⋮ Unnamed Item ⋮ Quantum entropic regularization of matrix-valued optimal transport ⋮ Estimation of positive definite \(M\)-matrices and structure learning for attractive Gaussian Markov random fields ⋮ Spline estimation of functional principal components via manifold conjugate gradient algorithm

This page was built for publication: Matrix Nearness Problems with Bregman Divergences