An improved algorithm for basis pursuit problem and its applications

DOI10.1016/J.AMC.2019.02.073MaRDI QIDQ2009392zbMATH OpenOpenAlexFDO

Authors Tanay Saha, Shwetabh Srivastava, Predrag S. Stanimirović, Marko D. Petković, Swanand R. Khare

Publication date 28 November 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2019.02.073

zbMATH Keywords

compressive sensinggeneralized inverseimage deblurringlinearized Bregman iterationsignal recoverysparse solution

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Numerical mathematical programming methods (65K05) Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Information theory (general) (94A15)

Recommendations

• A chaotic iterative algorithm based on linearized Bregman iteration for image deblurring
• Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
• Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
• Linearized Bregman iterations for compressed sensing
• A new reweighted minimization algorithm for image deblurring

Cites work

• A^--linearized Bregman iteration algorithm
• A chaotic iterative algorithm based on linearized Bregman iteration for image deblurring
• A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
• A new method for computing Moore-Penrose inverse matrices
• Accelerated linearized Bregman method
• An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
• An Iterative Regularization Method for Total Variation-Based Image Restoration
• Analysis and generalizations of the linearized Bregman method
• Augmented _1 and nuclear-norm models with a globally linearly convergent algorithm
• Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
• Compressed sensing
• Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
• Extensions of compressed sensing
• Fast linearized Bregman iteration for compressive sensing and sparse denoising
• scientific article; zbMATH DE number 1012640 (Why is no real title available?)
• Iterative method for computing the Moore-Penrose inverse based on Penrose equations
• Linearized Bregman iterations for compressed sensing
• Linearized Bregman Iterations for Frame-Based Image Deblurring
• On Iterative Computation of Generalized Inverses and Associated Projections
• Quantitative robust uncertainty principles and optimally sparse decompositions
• Regularization preconditioners for frame-based image deblurring with reduced boundary artifacts
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Successive matrix squaring algorithm for computing outer inverses
• Theory and applications of compressed sensing

Cited in

(8)

• A Laplacian approach to _1-norm minimization
• Modified bas iteration method for absolute value equation
• Semi-blind image deblurring by a proximal alternating minimization method with convergence guarantees
• Generalized alternating projection for weighted-\(\ell_{2,1}\) minimization with applications to model-based compressive sensing
• Existence and Representations of Solutions to Some Constrained Systems of Matrix Equations
• Cardinality minimization, constraints, and regularization: a survey
• Analysis of basis pursuit via capacity sets
• A multi-step sketch-and-project solver for large sparse inconsistent linear systems: applications in signal and image processing

This page was built for publication: An improved algorithm for basis pursuit problem and its applications

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