ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals (Q372857): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
This article develops an algorithm for underdetermined least squares problems with 1-norm constraint on the solution. It relies on a modified Nestorev method that periodically updates the prox-center optimally and renders the proposed method almost always linearly convergent. The method is then applied to find the minimum 1-norm solution to an underdetermined least squares problem when teamed with the Pareto root finder. Numerical tests show that these methods achieve comparable numerical results in comparable time for such a problem in image processing and other areas of application. | |||
Property / review text: This article develops an algorithm for underdetermined least squares problems with 1-norm constraint on the solution. It relies on a modified Nestorev method that periodically updates the prox-center optimally and renders the proposed method almost always linearly convergent. The method is then applied to find the minimum 1-norm solution to an underdetermined least squares problem when teamed with the Pareto root finder. Numerical tests show that these methods achieve comparable numerical results in comparable time for such a problem in image processing and other areas of application. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Frank Uhlig / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65F20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65F50 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65D18 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6217379 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
least squares problem | |||
Property / zbMATH Keywords: least squares problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Nesterov's method | |||
Property / zbMATH Keywords: Nesterov's method / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
basis pursuit | |||
Property / zbMATH Keywords: basis pursuit / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
denoising problem | |||
Property / zbMATH Keywords: denoising problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Pareto root finder | |||
Property / zbMATH Keywords: Pareto root finder / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
convex minimization | |||
Property / zbMATH Keywords: convex minimization / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
numerical example | |||
Property / zbMATH Keywords: numerical example / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
algorithm | |||
Property / zbMATH Keywords: algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
1-norm constraint | |||
Property / zbMATH Keywords: 1-norm constraint / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
minimum 1-norm solution | |||
Property / zbMATH Keywords: minimum 1-norm solution / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
image processing | |||
Property / zbMATH Keywords: image processing / rank | |||
Normal rank |
Revision as of 10:53, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals |
scientific article |
Statements
ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals (English)
0 references
21 October 2013
0 references
This article develops an algorithm for underdetermined least squares problems with 1-norm constraint on the solution. It relies on a modified Nestorev method that periodically updates the prox-center optimally and renders the proposed method almost always linearly convergent. The method is then applied to find the minimum 1-norm solution to an underdetermined least squares problem when teamed with the Pareto root finder. Numerical tests show that these methods achieve comparable numerical results in comparable time for such a problem in image processing and other areas of application.
0 references
least squares problem
0 references
Nesterov's method
0 references
basis pursuit
0 references
denoising problem
0 references
Pareto root finder
0 references
convex minimization
0 references
numerical example
0 references
algorithm
0 references
1-norm constraint
0 references
minimum 1-norm solution
0 references
image processing
0 references