Convergence of the linearized Bregman iteration for ℓ₁-norm minimization

DOI10.1090/S0025-5718-09-02242-XzbMath1198.65103MaRDI QIDQ3055191

Zuowei Shen, Jian-Feng Cai, Stanley J. Osher

Publication date: 7 November 2010

Published in: Mathematics of Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical mathematical programming methods (65K05)

Related Items

Blind motion deblurring using multiple images, Fast sparse reconstruction: Greedy inverse scale space flows, Revisiting linearized Bregman iterations under Lipschitz-like convexity condition, Constructing Surrogate Models of Complex Systems with Enhanced Sparsity: Quantifying the Influence of Conformational Uncertainty in Biomolecular Solvation, An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints, Simultaneously inpainting in image and transformed domains, A Greedy Algorithm for Sparse Precision Matrix Approximation, Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems, Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization, A dual split Bregman method for fast $\ell ^1$ minimization, Sparse generalized canonical correlation analysis via linearized Bregman method, Faster randomized block sparse Kaczmarz by averaging, Spatial feature extraction non-negative tensor factorization for hyperspectral unmixing, A proximal-based algorithm for piecewise sparse approximation with application to scattered data fitting, Error forgetting of Bregman iteration, Accelerated linearized Bregman method, A unified primal-dual algorithm framework based on Bregman iteration, Heat source identification based on \(\ell_1\) constrained minimization, Analysis on a superlinearly convergent augmented Lagrangian method, Linear convergence of the randomized sparse Kaczmarz method, Accelerating Sparse Recovery by Reducing Chatter, Inverse scale space decomposition, A two-step iterative algorithm for sparse hyperspectral unmixing via total variation, An adaptive inverse scale space method for compressed sensing, Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization, A Guide to the TV Zoo, Variational method for super-resolution optical flow, A new reweighted minimization algorithm for image deblurring, An improved algorithm for basis pursuit problem and its applications, Projected Landweber iteration for matrix completion, Iterative Solution Methods, Regularization Preconditioners for Frame-Based Image Deblurring with Reduced Boundary Artifacts, Learning Theory of Randomized Sparse Kaczmarz Method, Split Bregman iteration algorithm for total bounded variation regularization based image deblurring, A chaotic iterative algorithm based on linearized Bregman iteration for image deblurring, New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints, Nesterov's algorithm solving dual formulation for compressed sensing, Reprint of ``Nesterov's algorithm solving dual formulation for compressed sensing, Sparsity-homotopy perturbation inversion method with wavelets and applications to Black-Scholes model and Todaro model, Linearized Krylov subspace Bregman iteration with nonnegativity constraint, Convergence analysis of the Bregman method for the variational model of image denoising, An entropic Landweber method for linear ill-posed problems, A Laplacian approach to \(\ell_1\)-norm minimization, Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions, Modern regularization methods for inverse problems, An adaptive algorithm for TV-based model of three norms \(L_q\) \((q = \frac{1}{2}, 1, 2)\) in image restoration, A Network of Spiking Neurons for Computing Sparse Representations in an Energy-Efficient Way, Numerical aspects of the nonstationary modified linearized Bregman algorithm, On the grouping effect of the \(l_{1-2}\) models, Analysis of singular value thresholding algorithm for matrix completion, Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework, Regularized Kaczmarz Algorithms for Tensor Recovery, Stable recovery of low rank matrices from nuclear norm minimization, An Algorithm Solving Compressive Sensing Problem Based on Maximal Monotone Operators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces
• Error estimation for Bregman iterations and inverse scale space methods in image restoration
• Fast linearized Bregman iteration for compressive sensing and sparse denoising
• Iteratively solving linear inverse problems under general convex constraints
• Robust regression: Asymptotics, conjectures and Monte Carlo
• Deconvolution: a wavelet frame approach
• Convergence analysis of tight framelet approach for missing data recovery
• A framelet-based image inpainting algorithm
• Quantitative robust uncertainty principles and optimally sparse decompositions
• Multiplier and gradient methods
• A Singular Value Thresholding Algorithm for Matrix Completion
• Nonlinear iterative methods for linear ill-posed problems in Banach spaces
• Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Restoration of Chopped and Nodded Images by Framelets
• An iterative algorithm for signal reconstruction from bispectrum
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• De-noising by soft-thresholding
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• Signal Recovery by Proximal Forward-Backward Splitting
• An Iterative Regularization Method for Total Variation-Based Image Restoration
• Compressed sensing