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)

65F22: Ill-posedness and regularization problems in numerical linear algebra

65K05: Numerical mathematical programming methods

Related Items

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

Cites Work