Recovering Structured Signals in Noise: Least-Squares Meets Compressed Sensing (Q3460831)

From MaRDI portal

Revision as of 07:01, 11 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Recovering Structured Signals in Noise: Least-Squares Meets Compressed Sensing	scientific article

Statements

scholarly article

0 references

Recovering Structured Signals in Noise: Least-Squares Meets Compressed Sensing (English)

0 references

Christos Thrampoulidis

0 references

0 references

0 references

Compressed Sensing and its Applications

0 references

publication date

8 January 2016

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-16042-9_4

0 references

Living on the edge: phase transitions in convex programs with random data

0 references

The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing

0 references

The LASSO Risk for Gaussian Matrices

0 references

Square-root lasso: pivotal recovery of sparse signals via conic programming

0 references

0 references

Simultaneous analysis of Lasso and Dantzig selector

0 references

Exact matrix completion via convex optimization

0 references

Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

0 references

The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).

0 references

Stable signal recovery from incomplete and inaccurate measurements

0 references

Computational and statistical tradeoffs via convex relaxation

0 references

The convex geometry of linear inverse problems

0 references

De-noising by soft-thresholding

0 references

Compressed sensing

0 references

High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension

0 references

Neighborliness of randomly projected simplices in high dimensions

0 references

Sparse nonnegative solution of underdetermined linear equations by linear programming

0 references

Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing

0 references

Stable recovery of sparse overcomplete representations in the presence of noise

0 references

The Noise-Sensitivity Phase Transition in Compressed Sensing

0 references

Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising

0 references

The phase transition of matrix recovery from Gaussian measurements matches the minimax MSE of matrix denoising

0 references

Block-Sparse Signals: Uncertainty Relations and Efficient Recovery

0 references

Corrupted Sensing: Novel Guarantees for Separating Structured Signals

0 references

Tensor completion and low-n-rank tensor recovery via convex optimization

0 references

Some inequalities for Gaussian processes and applications

0 references

0 references

Applied Multivariate Statistical Analysis

0 references

Low-rank tensor completion by Riemannian optimization

0 references

0 references

Asymptotic Analysis of Complex LASSO via Complex Approximate Message Passing (CAMP)

0 references

From Steiner formulas for cones to concentration of intrinsic volumes

0 references

A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers

0 references

Sharp MSE bounds for proximal denoising

0 references

Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices

0 references

0 references

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

0 references

0 references

Gauss and the invention of least squares

0 references

On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements

0 references

The geometry of least squares in the 21st century

0 references

0 references

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

0 references

Compressive principal component pursuit

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-16042-9_4

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3460831

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3460831&oldid=36222596"