Analysis and Generalizations of the Linearized Bregman Method
From MaRDI portal
Publication:3052954
DOI10.1137/090760350zbMath1211.68491OpenAlexW2072378378MaRDI QIDQ3052954
Publication date: 3 November 2010
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/97348951b885eae4596d363e2fc2eeb7d1e81b71
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Interior-point methods (90C51)
Related Items
Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method, Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit, Quadratically Regularized Optimal Transport on Graphs, Revisiting linearized Bregman iterations under Lipschitz-like convexity condition, An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing, Local linear convergence of a primal-dual algorithm for the augmented convex models, 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, The modified accelerated Bregman method for regularized basis pursuit problem, Inexact accelerated augmented Lagrangian methods, The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector, Transformed primal-dual methods for nonlinear saddle point systems, Faster randomized block sparse Kaczmarz by averaging, Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems, Shrinking gradient descent algorithms for total variation regularized image denoising, Error forgetting of Bregman iteration, Accelerated linearized Bregman method, Accelerated Uzawa methods for convex optimization, A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm, A coupled variational model for image denoising using a duality strategy and split Bregman, Linear convergence of the randomized sparse Kaczmarz method, Learning circulant sensing kernels, Mini-workshop: Deep learning and inverse problems. Abstracts from the mini-workshop held March 4--10, 2018, Inverse scale space decomposition, Level-set methods for convex optimization, An adaptive inverse scale space method for compressed sensing, Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization, Templates for convex cone problems with applications to sparse signal recovery, An improved algorithm for basis pursuit problem and its applications, Learning Theory of Randomized Sparse Kaczmarz Method, Alternating direction method of multipliers with difference of convex functions, New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints, New regularization method and iteratively reweighted algorithm for sparse vector recovery, Linearized Krylov subspace Bregman iteration with nonnegativity constraint, Image reconstruction for diffuse optical tomography based on radiative transfer equation, Sparse recovery via differential inclusions, Unnamed Item, On the Convergence of Decentralized Gradient Descent, Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions, BinaryRelax: A Relaxation Approach for Training Deep Neural Networks with Quantized Weights, Modern regularization methods for inverse problems, A time continuation based fast approximate algorithm for compressed sensing related optimization, Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework, A primal-dual flow for affine constrained convex optimization, Convergence analysis of SART: optimization and statistics, Solving Basis Pursuit
Uses Software
