An Efficient Linearly Convergent Regularized Proximal Point Algorithm for Fused Multiple Graphical Lasso Problems
From MaRDI portal
Publication:4999369
DOI10.1137/20M1344160zbMath1470.90069arXiv1902.06952OpenAlexW2916763540MaRDI QIDQ4999369
Kim-Chuan Toh, Ning Zhang, Defeng Sun, Yangjing Zhang
Publication date: 6 July 2021
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.06952
Semidefinite programming (90C22) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Analysis of variance and covariance (ANOVA) (62J10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Sparse inverse covariance estimation with the graphical lasso
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- A Proximal Point Algorithm for Log-Determinant Optimization with Group Lasso Regularization
- Proximal Newton-Type Methods for Minimizing Composite Functions
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm
- Joint estimation of multiple graphical models
- Estimating Time-Varying Graphical Models
- A Selective Overview of Variable Selection in High Dimensional Feature Space (Invited Review Article)
- Gradient directed regularization for sparse Gaussian concentration graphs, with applications to inference of genetic networks
- Monotone Operators and the Proximal Point Algorithm
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Variational Analysis
- On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems
- A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
- Sparsity and Smoothness Via the Fused Lasso
- The Joint Graphical Lasso for Inverse Covariance Estimation Across Multiple Classes
- A Proximal Point Dual Newton Algorithm for Solving Group Graphical Lasso Problems
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem
- Fused Multiple Graphical Lasso
- Proximité et dualité dans un espace hilbertien
- Tuning Parameter Selection in High Dimensional Penalized Likelihood