Rejoinder: Latent variable graphical model selection via convex optimization (Q1940764)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Rejoinder: Latent variable graphical model selection via convex optimization

scientific article; zbMATH DE number 6142911

Language	Label	Description	Also known as
default for all languages	No label defined
English	Rejoinder: Latent variable graphical model selection via convex optimization	scientific article; zbMATH DE number 6142911

Statements

instance of

scholarly article

0 references

title

Rejoinder: Latent variable graphical model selection via convex optimization (English)

0 references

author

Venkat Chandrasekaran

0 references

Pablo A. Parrilo

0 references

Alan S. Willsky

0 references

published in

The Annals of Statistics

0 references

publication date

7 March 2013

0 references

full work available at URL

https://arxiv.org/abs/1211.0835

0 references

https://projecteuclid.org/euclid.aos/1351602534

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Regularized estimation of large covariance matrices

0 references

Covariance regularization by thresholding

0 references

Robust principal component analysis?

0 references

Exact matrix completion via convex optimization

0 references

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

0 references

Rejoinder: Latent variable graphical model selection via convex optimization

0 references

Rank-Sparsity Incoherence for Matrix Decomposition

0 references

Local operator theory, random matrices and Banach spaces.

0 references

Q4139463

0 references

For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution

0 references

Compressed sensing

0 references

Operator norm consistent estimation of large-dimensional sparse covariance matrices

0 references

``Ideal parent'' structure learning for continuous variable Bayesian networks

0 references

High dimensional covariance matrix estimation using a factor model

0 references

Q3998992

0 references

On the distribution of the largest eigenvalue in principal components analysis

0 references

Sparsistency and rates of convergence in large covariance matrix estimation

0 references

Q4382293

0 references

A well-conditioned estimator for large-dimensional covariance matrices

0 references

Q5531480

0 references

High-dimensional graphs and variable selection with the Lasso

0 references

Q5652137

0 references

High-dimensional covariance estimation by minimizing $\ell _{1}$-penalized log-determinant divergence

0 references

Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization

0 references

Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis

0 references

Sparse permutation invariant covariance estimation

0 references

Gaussian Markov distributions over finite graphs

0 references

SDPT3 — A Matlab software package for semidefinite programming, Version 1.3

0 references

Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)

0 references

Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm

0 references

Characterization of the subdifferential of some matrix norms

0 references

Nonparametric estimation of large covariance matrices of longitudinal data

0 references

Q3174050

0 references

Identifiers

zbMATH Open document ID

1288.62085

0 references

DOI

10.1214/12-AOS1020

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Rejoinder: Latent variable graphical model selection via convex optimization