An unbiased approach to compressed sensing (Q5132273)

!

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

An unbiased approach to compressed sensing

scientific article; zbMATH DE number 7272201

Language	Label	Description	Also known as
default for all languages	No label defined
English	An unbiased approach to compressed sensing	scientific article; zbMATH DE number 7272201

Statements

instance of

scholarly article

0 references

title

An unbiased approach to compressed sensing (English)

0 references

0 references

0 references

0 references

0 references

10 November 2020

0 references

full work available at URL

https://arxiv.org/abs/1806.05283

0 references

zbMATH Keywords

compressed sensing

0 references

regularization

0 references

non-convex optimization

0 references

non-smooth optimization

0 references

describes a project that uses

PDCO

0 references

sparsenet

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Generalized sampling and infinite-dimensional compressed sensing

0 references

Breaking the coherence barrier: a new theory for compressed sensing

0 references

Convex envelopes for fixed rank approximation

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

Compressed sensing: how sharp is the restricted isometry property?

0 references

Iterative thresholding for sparse approximations

0 references

Iterative hard thresholding for compressed sensing

0 references

Minimization of non-smooth, non-convex functionals by iterative thresholding

0 references

Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection

0 references

The restricted isometry property and its implications for compressed sensing

0 references

Robust principal component analysis?

0 references

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

0 references

Stable signal recovery from incomplete and inaccurate measurements

0 references

Decoding by Linear Programming

0 references

On convex envelopes and regularization of non-convex functionals without moving global minima

0 references

Atomic decomposition by basis pursuit

0 references

Signal Recovery by Proximal Forward-Backward Splitting

0 references

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

0 references

Stable recovery of sparse overcomplete representations in the presence of noise

0 references

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

0 references

Nonconcave penalized likelihood with a diverging number of parameters.

0 references

Strong oracle optimality of folded concave penalized estimation

0 references

A mathematical introduction to compressive sensing

0 references

Convex low rank approximation

0 references

Support recovery without incoherence: a case for nonconvex regularization

0 references

SparseNet: coordinate descent with nonconvex penalties

0 references

Sparse Approximate Solutions to Linear Systems

0 references

Enhancing sparsity by reweighted $\ell _{1}$ minimization

0 references

Description of the minimizers of least squares regularized with $\ell_0$-norm. Uniqueness of the global minimizer

0 references

Relationship between the optimal solutions of least squares regularized with $\ell_{0}$-norm and constrained by $k$-sparsity

0 references

Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression

0 references

Q5694963

0 references

A continuous exact $\ell_0$ penalty (CEL0) for least squares regularized problem

0 references

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

0 references

Sparse Regularization via Convex Analysis

0 references

Global convergence of ADMM in nonconvex nonsmooth optimization

0 references

Optimal computational and statistical rates of convergence for sparse nonconvex learning problems

0 references

Nearly unbiased variable selection under minimax concave penalty

0 references

A general theory of concave regularization for high-dimensional sparse estimation problems

0 references

One-step sparse estimates in nonconcave penalized likelihood models

0 references

Identifiers

zbMATH Open document ID

1458.94080

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1088/1361-6420/ABBD7F

0 references

Sitelinks

Mathematics(1 entry)

mardi An unbiased approach to compressed sensing