Fast alternating direction multipliers method by generalized Krylov subspaces
type: Item
instance of: scholarly article
title: Fast alternating direction multipliers method by generalized Krylov subspaces
zbMATH Open document ID: 1481.65058
author: Alessandro Buccini
published in: Journal of Scientific Computing
publication date: 2022-01-10T00:00:00Z
Mathematics Subject Classification ID: 65F22
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 7454943
zbMATH Keywords: ADMM method
zbMATH Keywords: ill-posed inverse problems
zbMATH Keywords: generalized Krylov subspaces
describes a project that uses: alr3
describes a project that uses: Regularization tools
describes a project that uses: AIR tools
describes a project that uses: IR Tools
MaRDI profile type: Publication
full work available at URL: s10915-021-01727-1
OpenAlex ID: W4200577140
cites work: Deconvolving Images With Unknown Boundaries Using the Alternating Direction Method of Multipliers
cites work: A generalized matrix Krylov subspace method for TV regularization
cites work: Q4868585
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: Large-scale regression with non-convex loss and penalty
cites work: A general framework for ADMM acceleration
cites work: A Semiblind Regularization Algorithm for Inverse Problems with Application to Image Deblurring
cites work: Numerical aspects of the nonstationary modified linearized Bregman algorithm
cites work: Linearized Krylov subspace Bregman iteration with nonnegativity constraint
cites work: Modulus-based iterative methods for constrained ℓ p – ℓ q minimization
cites work: An \(\ell^2\)-\(\ell^q\) regularization method for large discrete ill-posed problems
cites work: An \(\ell^p\)-\(\ell^q\) minimization method with cross-validation for the restoration of impulse noise contaminated images
cites work: Generalized cross validation for \(\ell^p\)-\(\ell^q\) minimization
cites work: Simultaneously inpainting in image and transformed domains
cites work: Linearized Bregman iterations for compressed sensing
cites work: Split Bregman Methods and Frame Based Image Restoration
cites work: Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
cites work: Image deblurring by sparsity constraint on the Fourier coefficients
cites work: Algorithms for the regularization of ill-conditioned least squares problems
cites work: Q4895893
cites work: A conjugate gradient like method for \(p\)-norm minimization in functional spaces
cites work: IR tools: a MATLAB package of iterative regularization methods and large-scale test problems
cites work: Fast Alternating Direction Optimization Methods
cites work: Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
cites work: Q4917542
cites work: Regularization methods for large-scale problems
cites work: AIR tools II: algebraic iterative reconstruction methods, improved implementation
cites work: Deblurring Images
cites work: Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration
cites work: Large-scale Tikhonov regularization via reduction by orthogonal projection
cites work: A Generalized Krylov Subspace Method for $\ell_p$-$\ell_q$ Minimization
cites work: Nonlinear total variation based noise removal algorithms
cites work: Q4066417
cites work: Applied Linear Regression
cites work: ADMM in Krylov Subspace and Its Application to Total Variation Restoration of Spatially Variant Blur
DOI: 10.1007/S10915-021-01727-1
description: scientific article; zbMATH DE number 7454943