Limited memory restarted \(\ell^p\)-\(\ell^q\) minimization methods using generalized Krylov subspaces
From MaRDI portal
Publication:6038831
DOI10.1007/s10444-023-10020-8zbMath1518.65030OpenAlexW4363677294MaRDI QIDQ6038831
Alessandro Buccini, Lothar Reichel
Publication date: 3 May 2023
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10444-023-10020-8
Nonconvex programming, global optimization (90C26) Iterative numerical methods for linear systems (65F10) Numerical methods for inverse problems for integral equations (65R32) Orthogonalization in numerical linear algebra (65F25)
Related Items (3)
An efficient implementation of the Gauss-Newton method via generalized Krylov subspaces ⋮ A computational framework for edge-preserving regularization in dynamic inverse problems ⋮ A variable projection method for large-scale inverse problems with \(\ell^1\) regularization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A new framework for multi-parameter regularization
- Multi-parameter Tikhonov regularization
- Old and new parameter choice rules for discrete ill-posed problems
- An \(\ell^2\)-\(\ell^q\) regularization method for large discrete ill-posed problems
- A comparison of parameter choice rules for \(\ell^p\)-\(\ell^q\) minimization
- Large-scale regression with non-convex loss and penalty
- Square smoothing regularization matrices with accurate boundary conditions
- A simplified L-curve method as error estimator
- 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
- Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
- Generalized cross validation for \(\ell^p\)-\(\ell^q\) minimization
- The Mathematics of Computerized Tomography
- Parameter Choice Strategies for Multipenalty Regularization
- Efficient determination of multiple regularization parameters in a generalized L-curve framework
- A Generalized Krylov Subspace Method for $\ell_p$-$\ell_q$ Minimization
- Deblurring Images
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- A Semiblind Regularization Algorithm for Inverse Problems with Application to Image Deblurring
- Modulus-based iterative methods for constrained ℓ p – ℓ q minimization
- Efficient Minimization Method for a Generalized Total Variation Functional
This page was built for publication: Limited memory restarted \(\ell^p\)-\(\ell^q\) minimization methods using generalized Krylov subspaces