ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals

DOI10.1007/s11075-012-9668-5zbMath1284.65055arXiv0911.0492OpenAlexW2108005121MaRDI QIDQ372857

Lek-Heng Lim, Ming Gu, Cinna Julie Wu

Publication date: 21 October 2013

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0911.0492

zbMATH Keywords

algorithmnumerical exampleimage processingleast squares problemconvex minimizationNesterov's method1-norm constraintbasis pursuitdenoising problemminimum 1-norm solutionPareto root finder

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (9)

A secant-based Nesterov method for convex functions ⋮ OSGA: a fast subgradient algorithm with optimal complexity ⋮ A General Theory of Singular Values with Applications to Signal Denoising ⋮ Activity Identification and Local Linear Convergence of Forward--Backward-type Methods ⋮ IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems ⋮ Templates for convex cone problems with applications to sparse signal recovery ⋮ Projected Landweber iteration for matrix completion ⋮ An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization ⋮ Adaptive restart for accelerated gradient schemes

Uses Software

• PDCO
• NESTA
• Sparco
• SPGL1
• ParNes
• FPC_AS

Cites Work

• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• The restricted isometry property and its implications for compressed sensing
• Submersions and preimages of sets of measure zero
• Least angle regression. (With discussion)
• Pathwise coordinate optimization
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
• NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• On Sparse Representations in Arbitrary Redundant Bases
• Just relax: convex programming methods for identifying sparse signals in noise
• Probing the Pareto Frontier for Basis Pursuit Solutions
• Two-Point Step Size Gradient Methods
• Inexact Newton Methods
• Atomic Decomposition by Basis Pursuit
• A new approach to variable selection in least squares problems
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• Sparse Reconstruction by Separable Approximation
• Sparse Approximate Solutions to Linear Systems
• Fast Image Recovery Using Variable Splitting and Constrained Optimization
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Stable signal recovery from incomplete and inaccurate measurements

This page was built for publication: ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals