What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization? (Q5001600): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1910.05652 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3138474759 / rank | |||
Normal rank | |||
Latest revision as of 08:31, 30 July 2024
scientific article; zbMATH DE number 7374135
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization? |
scientific article; zbMATH DE number 7374135 |
Statements
What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization? (English)
0 references
22 July 2021
0 references
maximum abstract simplicial complex
0 references
sparse recovery problems
0 references
