A linearly convergent algorithm without prior knowledge of operator norms for solving _1 - _2 minimization

DOI10.1016/J.AML.2021.107717MaRDI QIDQ2060804zbMATH OpenOpenAlexFDO

Authors Yaru Zhuang, Hai-Tao Che, Haibin Chen

Publication date 13 December 2021

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aml.2021.107717

zbMATH Keywords

convergenceimage restorationprojection-type algorithmsignal processing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
• Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization
• scientific article; zbMATH DE number 465458
• A new algorithm for nonlinear \(L_ 1\)-norm minimization with nonlinear equality constraints
• scientific article; zbMATH DE number 24382
• A method of linearizations for linearly constrained nonconvex nonsmooth minimization
• The linearized version of an algorithm for the mixed norms problem
• scientific article; zbMATH DE number 3916028
• An algorithm for linearly constrained convex nondifferentiable minimization problems

Cites work

• A Barzilai-Borwein gradient projection method for sparse signal and blurred image restoration
• A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
• A linearly convergent algorithm for sparse signal reconstruction
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• A wavelet tour of signal processing. The sparse way.
• An interior-point method for large-scale l₁-regularized logistic regression
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
• Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• General variational inequalities
• Global error bound for the generalized linear complementarity problem over a polyhedral cone
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• Minimum fuel neural networks and their applications to overcomplete signal representations
• Modified accelerated algorithms for solving variational inequalities
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

Cited in

(7)

• Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization
• Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization
• A generalized Krylov subspace method for _p-_q minimization
• A Projection Proximal-Point Algorithm for ℓ¹Minimization
• Algorithmic study of \(l_{2,1}\)-norm minimization problems
• Second order self-adaptive dynamical system for sparse signal reconstruction and applications to image recovery
• SOR- and Jacobi-type iterative methods for solving _1 - _2 problems by way of Fenchel duality

This page was built for publication: A linearly convergent algorithm without prior knowledge of operator norms for solving \(\ell_1 - \ell_2\) minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2060804)