Learning graph Laplacian with MCP

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Nearly unbiased variable selection under minimax concave penalty
Sparse inverse covariance estimation with the graphical lasso
Global convergence of a proximal linearized algorithm for difference of convex functions
An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
Minimax rate-optimal estimation of high-dimensional covariance matrices with incomplete data
On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
Sparsistency and rates of convergence in large covariance matrix estimation
Convex analysis approach to d. c. programming: Theory, algorithms and applications
DC programming and DCA: thirty years of developments
Sparse permutation invariant covariance estimation
Total positivity in Markov structures
Maximum likelihood estimation in Gaussian models under total positivity
Estimation of positive definite \(M\)-matrices and structure learning for attractive Gaussian Markov random fields
A nonsmooth version of Newton's method
Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
A proximal point algorithm for log-determinant optimization with group Lasso regularization
Hankel matrix rank minimization with applications to system identification and realization
Computing B-Stationary Points of Nonsmooth DC Programs
Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm
Clarke Subgradients of Stratifiable Functions
Model selection and estimation in the Gaussian graphical model
Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems
Learning Laplacian Matrix in Smooth Graph Signal Representations
Finite-Dimensional Variational Inequalities and Complementarity Problems
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
Likelihood-Based Selection and Sharp Parameter Estimation
A Unified Framework for Structured Graph Learning via Spectral Constraints
Optimization Algorithms for Graph Laplacian Estimation via ADMM and MM
Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
Proximité et dualité dans un espace hilbertien
Semismooth Matrix-Valued Functions
On the rate of convergence of the difference-of-convex algorithm (DCA)

This page was built for publication: Learning graph Laplacian with MCP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6640995)