A simple homotopy proximal mapping algorithm for compressive sensing (Q2425244)

scientific article; zbMATH DE number 7073616

Language	Label	Description	Also known as
default for all languages	No label defined
English	A simple homotopy proximal mapping algorithm for compressive sensing	scientific article; zbMATH DE number 7073616

Statements

instance of

scholarly article

0 references

title

A simple homotopy proximal mapping algorithm for compressive sensing (English)

0 references

0 references

0 references

0 references

0 references

0 references

0 references

26 June 2019

0 references

zbMATH Keywords

compressive sensing

0 references

sparse signal recovery

0 references

proximal mapping

0 references

linear convergence

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10994-018-5772-7

0 references

cites work

Fast global convergence of gradient methods for high-dimensional statistical recovery

0 references

Sparse Recovery of Streaming Signals Using <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Homotopy

0 references

NESTA: A fast and accurate first-order method for sparse recovery

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Simultaneous analysis of Lasso and Dantzig selector

0 references

Iterative hard thresholding for compressed sensing

0 references

A primal-dual homotopy algorithm for $\ell _{1}$-minimization with $\ell _{\infty }$-constraints

0 references

Linear convergence of iterative soft-thresholding

0 references

Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices

0 references

The restricted isometry property and its implications for compressed sensing

0 references

Stable signal recovery from incomplete and inaccurate measurements

0 references

Decoding by Linear Programming

0 references

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

0 references

Atomic Decomposition by Basis Pursuit

0 references

Atomic decomposition by basis pursuit

0 references

A sparse Johnson-Lindenstrauss transform

0 references

Adaptive greedy approximations

0 references

Compressed sensing

0 references

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

0 references

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

0 references

The Noise-Sensitivity Phase Transition in Compressed Sensing

0 references

Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse

0 references

Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit

0 references

Least angle regression. (With discussion)

0 references

Decomposable norm minimization with proximal-gradient homotopy algorithm

0 references

Hard Thresholding Pursuit: An Algorithm for Compressive Sensing

0 references

Bonferroni inequalities

0 references

Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence

0 references

A Bound on Tail Probabilities for Quadratic Forms in Independent Random Variables

0 references

Extensions of Lipschitz mappings into a Hilbert space

0 references

Sparser Johnson-Lindenstrauss Transforms

0 references

Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.

0 references

Matrix recipes for hard thresholding methods

0 references

An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization

0 references

An infeasible-point subgradient method using adaptive approximate projections

0 references

Solving Basis Pursuit

0 references

Matching pursuits with time-frequency dictionaries

0 references

High-dimensional graphs and variable selection with the Lasso

0 references

CoSaMP: Iterative signal recovery from incomplete and inaccurate samples

0 references

Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit

0 references

A new approach to variable selection in least squares problems

0 references

Sharp Time–Data Tradeoffs for Linear Inverse Problems

0 references

One-bit compressed sensing by linear programming

0 references

Q4000065

0 references

Convex Analysis

0 references

Q4864293

0 references

The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing

0 references

Greed is Good: Algorithmic Results for Sparse Approximation

0 references

Just relax: convex programming methods for identifying sparse signals in noise

0 references

Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit

0 references

On the conditions used to prove oracle results for the Lasso

0 references

Probing the Pareto frontier for basis pursuit solutions

0 references

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

0 references

A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation

0 references

Sparse Reconstruction by Separable Approximation

0 references

A proximal-gradient homotopy method for the sparse least-squares problem

0 references

Some sharp performance bounds for least squares regression with $L_1$ regularization

0 references

The sparsity and bias of the LASSO selection in high-dimensional linear regression

0 references

Q3174050

0 references

Identifiers

zbMATH Open document ID

1493.94008

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1007/S10994-018-5772-7

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2425244