For most large underdetermined systems of equations, the minimal š<sub>1</sub>ānorm nearāsolution approximates the sparsest nearāsolution (Q5486262)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: For most large underdetermined systems of equations, the minimal š1ānorm nearāsolution approximates the sparsest nearāsolution |
scientific article; zbMATH DE number 5051894
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | For most large underdetermined systems of equations, the minimal š<sub>1</sub>ānorm nearāsolution approximates the sparsest nearāsolution |
scientific article; zbMATH DE number 5051894 |
Statements
For most large underdetermined systems of equations, the minimal š<sub>1</sub>ānorm nearāsolution approximates the sparsest nearāsolution (English)
0 references
6 September 2006
0 references
combinatorial optimization
0 references
