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 the normal view instead:
scientific article; zbMATH DE number 5051894
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9328187108039856
0 references
0.8746521472930908
0 references
0.8641170263290405
0 references
0.8625635504722595
0 references
0.8514152765274048
0 references
