Learning graph Laplacian with MCP
type: Item
instance of: scholarly article
title: Learning graph Laplacian with MCP
DOI: 10.1080/10556788.2023.2269594
author: Yangjing Zhang
author: Kim-Chuan Toh
author: Defeng Sun
published in: Optimization Methods \& Software
publication date: 2024-11-20T00:00:00Z
Mathematics Subject Classification ID: 90Cxx
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 7946978
MaRDI profile type: Publication
cites work: On the rate of convergence of the difference-of-convex algorithm (DCA)
cites work: Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
cites work: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
cites work: Q3096116
cites work: Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
cites work: Clarke Subgradients of Stratifiable Functions
cites work: The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
cites work: Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
cites work: Minimax rate-optimal estimation of high-dimensional covariance matrices with incomplete data
cites work: An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
cites work: Q5691133
cites work: Q3996569
cites work: Learning Laplacian Matrix in Smooth Graph Signal Representations
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Total positivity in Markov structures
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
cites work: Hankel matrix rank minimization with applications to system identification and realization
cites work: Sparse inverse covariance estimation with the graphical lasso
cites work: Q4917542
cites work: A Unified Framework for Structured Graph Learning via Spectral Constraints
cites work: Q3813205
cites work: Sparsistency and rates of convergence in large covariance matrix estimation
cites work: Maximum likelihood estimation in Gaussian models under total positivity
cites work: Q4382293
cites work: DC programming and DCA: thirty years of developments
cites work: Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
cites work: An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
cites work: On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems
cites work: Proximité et dualité dans un espace hilbertien
cites work: Computing B-Stationary Points of Nonsmooth DC Programs
cites work: A nonsmooth version of Newton's method
cites work: Sparse permutation invariant covariance estimation
cites work: Likelihood-Based Selection and Sharp Parameter Estimation
cites work: Estimation of positive definite \(M\)-matrices and structure learning for attractive Gaussian Markov random fields
cites work: Global convergence of a proximal linearized algorithm for difference of convex functions
cites work: Semismooth Matrix-Valued Functions
cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications
cites work: Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm
cites work: A proximal point algorithm for log-determinant optimization with group Lasso regularization
cites work: Model selection and estimation in the Gaussian graphical model
cites work: Nearly unbiased variable selection under minimax concave penalty
cites work: Optimization Algorithms for Graph Laplacian Estimation via ADMM and MM
description: scientific article; zbMATH DE number 7946978