Modulus-based iterative methods for constrained ℓ p – ℓ q minimization
From MaRDI portal
Publication:5117383
DOI10.1088/1361-6420/ab9f86zbMath1451.65072OpenAlexW3038030374MaRDI QIDQ5117383
Alessandro Buccini, Mirjeta Pasha, Lothar Reichel
Publication date: 25 August 2020
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/1361-6420/ab9f86
Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical mathematical programming methods (65K05) Convex programming (90C25)
Related Items
A Krylov subspace type method for Electrical Impedance Tomography ⋮ Uniformly convex neural networks and non-stationary iterated network Tikhonov (iNETT) method ⋮ Graph Laplacian for image deblurring ⋮ Limited memory restarted \(\ell^p\)-\(\ell^q\) minimization methods using generalized Krylov subspaces ⋮ A modulus iteration method for non-negatively constrained TV image restoration ⋮ A computational framework for edge-preserving regularization in dynamic inverse problems ⋮ Variable selection in saturated and supersaturated designs via lp-lq minimization ⋮ Large-scale regression with non-convex loss and penalty ⋮ Variable projection methods for separable nonlinear inverse problems with general-form Tikhonov regularization ⋮ On the choice of regularization matrix for an \(\ell_2\)-\(\ell_q\) minimization method for image restoration ⋮ Fast alternating direction multipliers method by generalized Krylov subspaces ⋮ A comparison of parameter choice rules for \(\ell^p\)-\(\ell^q\) minimization ⋮ A variational non-linear constrained model for the inversion of FDEM data* ⋮ Foreword to special issue of Inverse Problems on modern challenges in imaging
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Nonstationary iterated thresholding algorithms for image deblurring
- Modulus-based iterative methods for constrained Tikhonov regularization
- An iteratively approximated gradient projection algorithm for sparse signal reconstruction
- Non-convex sparse regularisation
- Sufficient matrices and the linear complementarity problem
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- A conjugate gradient like method for \(p\)-norm minimization in functional spaces
- An \(\ell^2\)-\(\ell^q\) regularization method for large discrete ill-posed problems
- An \(\ell^p\)-\(\ell^q\) minimization method with cross-validation for the restoration of impulse noise contaminated images
- Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration
- IR tools: a MATLAB package of iterative regularization methods and large-scale test problems
- Constrained TV\(_p\)-\(\ell_2\) model for image restoration
- Regularization Preconditioners for Frame-Based Image Deblurring with Reduced Boundary Artifacts
- Modulus-Type Inner Outer Iteration Methods for Nonnegative Constrained Least Squares Problems
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Modulus-based matrix splitting iteration methods for linear complementarity problems
- Linearized Bregman Iterations for Frame-Based Image Deblurring
- A Generalized Krylov Subspace Method for $\ell_p$-$\ell_q$ Minimization
- Regularization with non-convex separable constraints
- Deblurring Images
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Split Bregman Methods and Frame Based Image Restoration
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Rank-Deficient and Discrete Ill-Posed Problems
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning
- A convergence rates result for Tikhonov regularization in Banach spaces with non-smooth operators
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Compressed sensing
