Matrix sparsification and the sparse null space problem (Q329287): Difference between revisions

Latest revision as of 18:31, 12 July 2024

scientific article; zbMATH DE number 5783898

Matrix Sparsification and the Sparse Null Space Problem

Language	Label	Description	Also known as
English	Matrix sparsification and the sparse null space problem	scientific article; zbMATH DE number 5783898	Matrix Sparsification and the Sparse Null Space Problem

Statements

instance of

scholarly article

0 references

title

Matrix sparsification and the sparse null space problem (English)

0 references

Matrix Sparsification and the Sparse Null Space Problem (English)

0 references

0 references

0 references

0 references

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

0 references

publication date

21 October 2016

0 references

10 September 2010

0 references

full work available at URL

https://arxiv.org/abs/1008.1498

0 references

zbMATH Keywords

matrix sparsification

0 references

sparse null space

0 references

sparse approximation

0 references

describes a project that uses

mctoolbox

0 references

CoSaMP

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

The complexity and approximability of finding maximum feasible subsystems of linear relations

0 references

The hardness of approximate optima in lattices, codes, and systems of linear equations

0 references

Q4828976

0 references

An algorithm to compute a sparse basis of the null space

0 references

The Sparse Basis Problem and Multilinear Algebra

0 references

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

0 references

Decoding by Linear Programming

0 references

A hierarchical algorithm for making sparse matrices sparser

0 references

Computing a Sparse Basis for the Null Space

0 references

Entropy-based algorithms for best basis selection

0 references

The Null Space Problem I. Complexity

0 references

Approximating CVP to within almost-polynomial factors is NP-hard

0 references

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

0 references

Q3740904

0 references

On Sparse Representations in Arbitrary Redundant Bases

0 references

Near-optimal sparse fourier representations via sampling

0 references

Accuracy and Stability of Numerical Algorithms

0 references

Q3683420

0 references

The densest hemisphere problem

0 references

Q4764626

0 references

Automata, Languages and Programming

0 references

Q4146667

0 references

Understanding and using linear programming

0 references

Sparse Approximate Solutions to Linear Systems

0 references

CoSaMP: Iterative signal recovery from incomplete and inaccurate samples

0 references

Dense Error Correction Via $\ell^1$-Minimization

0 references

Nonlinear methods of approximation

0 references

Q4337625

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

Designing structured tight frames via an alternating projection method

0 references

A Simple Proof of Descartes's Rule of Signs

0 references

Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis

0 references

Identifiers

zbMATH Open document ID

1347.68369

0 references

1304.68216

0 references

DOI

10.1007/s00453-015-0042-6

0 references

10.1007/978-3-642-15369-3_16

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:329287

@@ Property / cites work @@
+The complexity and approximability of finding maximum feasible subsystems of linear relations
+Normal rank
@@ Property / cites work @@
+The hardness of approximate optima in lattices, codes, and systems of linear equations
+Normal rank
@@ Property / cites work @@
+Q4828976
@@ Property / cites work: Q4828976 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm to compute a sparse basis of the null space
+Normal rank
@@ Property / cites work @@
+The Sparse Basis Problem and Multilinear Algebra
@@ Property / cites work: The Sparse Basis Problem and Multilinear Algebra / rank @@
+Normal rank
@@ Property / cites work @@
+Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
+Normal rank
@@ Property / cites work @@
+Decoding by Linear Programming
@@ Property / cites work: Decoding by Linear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+A hierarchical algorithm for making sparse matrices sparser
+Normal rank
@@ Property / cites work @@
+Computing a Sparse Basis for the Null Space
@@ Property / cites work: Computing a Sparse Basis for the Null Space / rank @@
+Normal rank
@@ Property / cites work @@
+Entropy-based algorithms for best basis selection
@@ Property / cites work: Entropy-based algorithms for best basis selection / rank @@
+Normal rank
@@ Property / cites work @@
+The Null Space Problem I. Complexity
@@ Property / cites work: The Null Space Problem I. Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating CVP to within almost-polynomial factors is NP-hard
+Normal rank
@@ Property / cites work @@
+For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution
+Normal rank
@@ Property / cites work @@
+Q3740904
@@ Property / cites work: Q3740904 / rank @@
+Normal rank
@@ Property / cites work @@
+On Sparse Representations in Arbitrary Redundant Bases
+Normal rank
@@ Property / cites work @@
+Near-optimal sparse fourier representations via sampling
+Normal rank
@@ Property / cites work @@
+Accuracy and Stability of Numerical Algorithms
@@ Property / cites work: Accuracy and Stability of Numerical Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3683420
@@ Property / cites work: Q3683420 / rank @@
+Normal rank
@@ Property / cites work @@
+The densest hemisphere problem
@@ Property / cites work: The densest hemisphere problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4764626
@@ Property / cites work: Q4764626 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q4146667
@@ Property / cites work: Q4146667 / rank @@
+Normal rank
@@ Property / cites work @@
+Understanding and using linear programming
@@ Property / cites work: Understanding and using linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse Approximate Solutions to Linear Systems
@@ Property / cites work: Sparse Approximate Solutions to Linear Systems / rank @@
+Normal rank
@@ Property / cites work @@
+CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
+Normal rank
@@ Property / cites work @@
+Dense Error Correction Via $\ell^1$-Minimization
@@ Property / cites work: Dense Error Correction Via $\ell^1$-Minimization / rank @@
+Normal rank
@@ Property / cites work @@
+Nonlinear methods of approximation
@@ Property / cites work: Nonlinear methods of approximation / rank @@
+Normal rank
@@ Property / cites work @@
+Q4337625
@@ Property / cites work: Q4337625 / rank @@
+Normal rank
@@ Property / cites work @@
+Greed is Good: Algorithmic Results for Sparse Approximation
+Normal rank
@@ Property / cites work @@
+Just relax: convex programming methods for identifying sparse signals in noise
+Normal rank
@@ Property / cites work @@
+Designing structured tight frames via an alternating projection method
+Normal rank
@@ Property / cites work @@
+A Simple Proof of Descartes's Rule of Signs
@@ Property / cites work: A Simple Proof of Descartes's Rule of Signs / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis
+Normal rank