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 |
ReferenceBot (talk | contribs) Changed an Item |
||
(11 intermediate revisions by 5 users not shown) | |||
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 | |||
Property / describes a project that uses | |||
Property / describes a project that uses: FPC_AS / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: NESTA / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Sparco / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: ParNes / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: SPGL1 / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: PDCO / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2108005121 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0911.0492 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Image Recovery Using Variable Splitting and Constrained Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two-Point Step Size Gradient Methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: NESTA: A Fast and Accurate First-Order Method for Sparse Recovery / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The restricted isometry property and its implications for compressed sensing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder). / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stable signal recovery from incomplete and inaccurate measurements / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Atomic Decomposition by Basis Pursuit / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Inexact Newton Methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Least angle regression. (With discussion) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sparse Reconstruction by Separable Approximation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pathwise coordinate optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Sparse Representations in Arbitrary Redundant Bases / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sparse Approximate Solutions to Linear Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Smooth minimization of non-smooth functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new approach to variable selection in least squares problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Submersions and preimages of sets of measure zero / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4864293 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Just relax: convex programming methods for identifying sparse signals in noise / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probing the Pareto Frontier for Basis Pursuit Solutions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 23:50, 6 July 2024
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
0 references
0 references