arrow
Return

Proximal approaches for matrix optimization problems: Application to robust precision matrix estimation

delete2020-04-01
delete10
delete
OA
AI
A
Alessandro Benfenati *
É
Émilie Chouzenoux
J
Jean‐Christophe Pesquet
DOI:10.1016/j.sigpro.2019.107417delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
In recent years, there has been a growing interest in mathematical models leading to the minimization, in a symmetric matrix space, of a Bregman divergence coupled with a regularization term. We address problems of this type within a general framework where the regularization term is split into two parts, one being a spectral function while the other is arbitrary. A Douglas-Rachford approach is proposed to address such problems, and a list of proximity operators is provided allowing us to consider various choices for the fit-to-data functional and for the regularization term. Based on our theoretical results, two novel approaches are proposed for the noisy graphical lasso problem, where a covariance or precision matrix has to be statistically estimated in presence of noise. The Douglas-Rachford approach directly applies to the estimation of the covariance matrix. When the precision matrix is sought, we solve a non convex optimization problem. More precisely, we propose a majorization-minimization approach building a sequence of convex surrogates and solving the inner optimization subproblems via the aforementioned Douglas-Rachford procedure. We establish conditions for the convergence of this iterative scheme. We illustrate the good numerical performance of the proposed approaches with respect to state-of-the-art approaches on synthetic and real-world datasets. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Covariance estimation
Graphical lasso
Matrix optimization
Douglas-Rachford method
Majorization-minimization
Bregman divergence
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Signal Processing cover
Signal Processing
IF:
3.6
Papers:
9.9K
Citations:
1.7W

Organization

U
Universite Paris Saclay
Scholars:
7.3W
Papers: 5.3W
Citations: 540
U
University of Milan
Scholars:
5.1W
Papers: 3.9W
Citations: 5.0W