Gradient-Based Methods for Sparse Recovery

DOI10.1137/090775063zbMath1209.90266arXiv0912.1660OpenAlexW1999627297MaRDI QIDQ3077129

Hongchao Zhang, Dzung T. Phan, William W. Hager

Publication date: 22 February 2011

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

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

zbMATH Keywords

nonsmooth optimizationlinear convergenceimage reconstructiondenoisingsparse recoverycompressed sensingiterative shrinkage thresholding algorithmsublinear convergenceBB methodnonmonotone convergencesparse reconstruction by separable approximation

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Complexity and performance of numerical algorithms (65Y20)

Related Items (25)

A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem ⋮ A model of regularization parameter determination in low-dose X-ray CT reconstruction based on dictionary learning ⋮ An extended projected residual algorithm for solving smooth convex optimization problems ⋮ A truncated Newton algorithm for nonconvex sparse recovery ⋮ An efficient augmented Lagrangian method with applications to total variation minimization ⋮ On the rate of convergence of projected Barzilai–Borwein methods ⋮ An active set algorithm for nonlinear optimization with polyhedral constraints ⋮ On globally Q-linear convergence of a splitting method for group Lasso ⋮ An active set Newton-CG method for \(\ell_1\) optimization ⋮ A note on the spectral gradient projection method for nonlinear monotone equations with applications ⋮ Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems ⋮ A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares ⋮ Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems ⋮ Bregman operator splitting with variable stepsize for total variation image reconstruction ⋮ Gradient-based method with active set strategy for $\ell _1$ optimization ⋮ Active Set Complexity of the Away-Step Frank--Wolfe Algorithm ⋮ A new generalized shrinkage conjugate gradient method for sparse recovery ⋮ A Barzilai-Borwein type method for minimizing composite functions ⋮ A new spectral method for \(l_1\)-regularized minimization ⋮ An $\mathcal O(1/{k})$ Convergence Rate for the Variable Stepsize Bregman Operator Splitting Algorithm ⋮ Projection onto a Polyhedron that Exploits Sparsity ⋮ A fast conjugate gradient algorithm with active set prediction for ℓ₁ optimization ⋮ A Hybrid Finite-Dimensional RHC for Stabilization of Time-Varying Parabolic Equations ⋮ A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring ⋮ Nomonotone spectral gradient method for sparse recovery

This page was built for publication: Gradient-Based Methods for Sparse Recovery