A linearly convergent algorithm without prior knowledge of operator norms for solving \(\ell_1 - \ell_2\) minimization
type: Item
instance of: scholarly article
title: A linearly convergent algorithm without prior knowledge of operator norms for solving \(\ell_1 - \ell_2\) minimization
zbMATH Open document ID: 1503.90096
author: Yaru Zhuang
author: Hai-Tao Che
author: Haibin Chen
published in: Applied Mathematics Letters
publication date: 2021-12-13T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 94A08
Mathematics Subject Classification ID: 94A12
zbMATH DE Number: 7443216
zbMATH Keywords: projection-type algorithm
zbMATH Keywords: convergence
zbMATH Keywords: signal processing
zbMATH Keywords: image restoration
MaRDI profile type: Publication
full work available at URL: j.aml.2021.107717
OpenAlex ID: W3205960111
cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
cites work: Minimum fuel neural networks and their applications to overcomplete signal representations
cites work: A unified treatment of some iterative algorithms in signal processing and image reconstruction
cites work: Q3634482
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
cites work: Q3174129
cites work: Modified accelerated algorithms for solving variational inequalities
cites work: Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
cites work: Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
cites work: A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
cites work: A linearly convergent algorithm for sparse signal reconstruction
cites work: A Barzilai-Borwein gradient projection method for sparse signal and blurred image restoration
cites work: Q3151174
cites work: General variational inequalities
cites work: Global error bound for the generalized linear complementarity problem over a polyhedral cone
DOI: 10.1016/J.AML.2021.107717
Recommended article: Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
Recommended article: Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization
Recommended article: Q4271860
Recommended article: A new algorithm for nonlinear \(L_ 1\)-norm minimization with nonlinear equality constraints
Recommended article: Q3982460
Recommended article: A method of linearizations for linearly constrained nonconvex nonsmooth minimization
Recommended article: The linearized version of an algorithm for the mixed norms problem
Recommended article: Q3691428
Recommended article: An algorithm for linearly constrained convex nondifferentiable minimization problems
description: scientific article; zbMATH DE number 7443216