scientific article; zbMATH DE number 6797621
From MaRDI portal
Publication:5371195
zbMath1376.65093MaRDI QIDQ5371195
Publication date: 25 October 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
matrix completionsparsitycompressive sensingnuclear norm\(\ell_1\) normunderdetermined systems of linear equationsGaussian widthsconvex programinglow-rank-matrices
Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Convex programming (90C25) Matrix completion problems (15A83)
Related Items (8)
Combining a relaxed EM algorithm with Occam's razor for Bayesian variable selection in high-dimensional regression ⋮ Computing sparse GCD of multivariate polynomials via polynomial interpolation ⋮ Solving inverse problems for steady-state equations using a multiple criteria model with collage distance, entropy, and sparsity ⋮ On sparse approximations of solutions to linear systems with orthogonal matrices ⋮ Decomposition of dynamical signals into jumps, oscillatory patterns, and possible outliers ⋮ Robust group lasso: model and recoverability ⋮ Generalized penalty for circular coordinate representation ⋮ Unnamed Item
This page was built for publication:
