Finding sparse solutions of systems of polynomial equations via group-sparsity optimization (Q2349523): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CVX / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PhaseLift / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092754161 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1311.5871 / rank | |||
Normal rank | |||
Revision as of 05:50, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding sparse solutions of systems of polynomial equations via group-sparsity optimization |
scientific article |
Statements
Finding sparse solutions of systems of polynomial equations via group-sparsity optimization (English)
0 references
22 June 2015
0 references
sparsity
0 references
compressed sensing
0 references
convex relaxation
0 references
basis pursuit
0 references
phase retrieval
0 references
polynomial systems
0 references
