An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection

DOI10.1007/s12532-010-0020-6zbMath1208.90131MaRDI QIDQ621755

Kim-Chuan Toh, Lu Li

Publication date: 28 January 2011

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-010-0020-6

zbMATH Keywords

iterative solver; inexact search direction; log-determinant semidefinite programming

Mathematics Subject Classification ID

90C22: Semidefinite programming

90C25: Convex programming

90C06: Large-scale problems in mathematical programming

90C51: Interior-point methods

65F10: Iterative numerical methods for linear systems

Uses Software

• CSDP
• Matlab
• SeDuMi
• SDPT3
• QSDP
• glasso
• BMSS
• MIM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• Sparse inverse covariance estimation with the graphical lasso
• An inexact primal-dual path following algorithm for convex quadratic SDP
• A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
• Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
• Network exploration via the adaptive LASSO and SCAD penalties
• High-dimensional graphs and variable selection with the Lasso
• Efficient estimation of covariance selection models
• Nonparametric estimation of large covariance matrices of longitudinal data
• Adaptive First-Order Methods for General Sparse Inverse Covariance Selection
• A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
• Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm
• Model selection and estimation in the Gaussian graphical model
• First-Order Methods for Sparse Covariance Selection
• An Augmented Primal-Dual Method for Linear Conic Programs
• Smooth Optimization Approach for Sparse Covariance Selection
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Determinant Maximization with Linear Matrix Inequality Constraints
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• Introduction to Graphical Modelling
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
• Statistical significance for genomewide studies
• Covariance selection for nonchordal graphs via chordal embedding