For most large underdetermined systems of equations, the minimal š<sub>1</sub>ānorm nearāsolution approximates the sparsest nearāsolution (Q5486262): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) āChanged an Item Ā |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Ā | |||
| Property / full work available at URL: https://doi.org/10.1002/cpa.20131 / rank | |||
| Ā | Normal rank | ||
| Property / OpenAlex ID | |||
| Ā | |||
| Property / OpenAlex ID: W2114147096 / rank | |||
| Ā | Normal rank | ||
| Property / cites work | |||
| Ā | |||
| Property / cites work: Q2760174 / rank | |||
| Ā | Normal rank | ||
| links / mardi / name | links / mardi / name | ||
| Ā | |||
Latest revision as of 18:56, 24 June 2024
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
