A Proximal Approach for a Class of Matrix Optimization Problems
arXiv:1801.07452 · doi:10.1016/j.sigpro.2019.107417
Abstract
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 in 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. Numerical experiments show the validity of this approach for solving convex optimization problems encountered in the context of sparse covariance matrix estimation. Based on our theoretical results, an algorithm is also proposed for noisy graphical lasso where a precision matrix has to be estimated in the presence of noise. The nonconvexity of the resulting objective function is dealt with a majorization-minimization approach, i.e. by 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 and we illustrate its good numerical performance with respect to state-of-the-art approaches.
References in corpus (14)
- High-dimensional graphs and variable selection with the Lasso
- Proceedings of the 29th International Conference on Machine Learning (ICML-12)
- Sinc approximation of algebraically decaying functions
- Sparse permutation invariant covariance estimation
- Latent variable graphical model selection via convex optimization
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Projected Subgradient Methods for Learning Sparse Gaussians
- Robust Estimation of Structured Covariance Matrix for Heavy-Tailed Elliptical Distributions
- Recovery of Low-Rank Plus Compressed Sparse Matrices with Application to Unveiling Traffic Anomalies
- Sparse Inverse Covariance Selection via Alternating Linearization Methods
- Global convergence of a non-convex Douglas-Rachford iteration
- Beyond Low Rank + Sparse: Multi-scale Low Rank Matrix Decomposition
- Convergence Rate Analysis of the Majorize-Minimize Subspace Algorithm -- Extended Version
- Gaussian Graphical Models: An Algebraic and Geometric Perspective
Cited by in corpus (6)
- Fixed Point Strategies in Data Science
- Graphical Inference in Linear-Gaussian State-Space Models
- A Laplacian Approach to -Norm Minimization
- Sparse Graphical Linear Dynamical Systems
- Efficient Hierarchical Bayesian Inference for Spatio-temporal Regression Models in Neuroimaging
- Implicit Differentiation for Hyperparameter Tuning the Weighted Graphical Lasso