A variable projection method for large-scale inverse problems with \(\ell^1\) regularization
From MaRDI portal
Publication:6086881
DOI10.1016/j.apnum.2023.06.015zbMath1528.65031OpenAlexW4382364394MaRDI QIDQ6086881
Matthias Chung, Rosemary A. Renaut
Publication date: 10 November 2023
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2023.06.015
regularizationinverse problemsalternating direction method of multipliers (ADMM)variable projection\( \chi^2\) test
Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical mathematical programming methods (65K05) Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Degrees of freedom in lasso problems
- The solution path of the generalized lasso
- On the ADI method for Sylvester equations
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Application of the alternating direction method of multipliers to separable convex programming problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A proximal-based deomposition method for compositions method for convex minimization problems
- Least angle regression. (With discussion)
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Regularization by architecture: a deep prior approach for inverse problems
- Residual whiteness principle for parameter-free image restoration
- The generalized Lasso problem and uniqueness
- ADMM-EM method for \(L_1\)-norm regularized weighted least squares PET reconstruction
- Automated parameter selection for total variation minimization in image restoration
- Convergence rates for an inexact ADMM applied to separable convex optimization
- Fast alternating direction multipliers method by generalized Krylov subspaces
- A comparison of parameter choice rules for \(\ell^p\)-\(\ell^q\) minimization
- \( \chi^2\) test for total variation regularization parameter selection
- Coordinate descent algorithms
- Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration
- Variable projection for nonlinear least squares problems
- Inexact alternating direction methods of multipliers for separable convex optimization
- IR tools: a MATLAB package of iterative regularization methods and large-scale test problems
- On the ``degrees of freedom of the lasso
- Multiplier and gradient methods
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
- The Split Bregman Method for L1-Regularized Problems
- A Generalized Krylov Subspace Method for $\ell_p$-$\ell_q$ Minimization
- Deblurring Images
- Decoding by Linear Programming
- A Newton root-finding algorithm for estimating the regularization parameter for solving ill-conditioned least squares problems
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Modified Lagrangians in convex programming and their generalizations
- Rank-Deficient and Discrete Ill-Posed Problems
- Separable nonlinear least squares: the variable projection method and its applications
- First-Order Methods in Optimization
- Computational Methods for Inverse Problems
- Minimization and parameter estimation for seminorm regularization models with I -divergence constraints
- The degrees of freedom of the Lasso for general design matrix
- Sampled Tikhonov regularization for large linear inverse problems
- Sampled limited memory methods for massive linear inverse problems
- slimTrain---A Stochastic Approximation Method for Training Separable Deep Neural Networks
- Learning regularization parameters of inverse problems via deep neural networks
- Train Like a (Var)Pro: Efficient Training of Neural Networks with Variable Projection
- Fast Alternating Direction Optimization Methods
- Discrete Inverse Problems
- First Order Algorithms in Variational Image Processing
- Introduction to Bayesian Scientific Computing
- The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- The Estimation of Prediction Error
- Methods of conjugate gradients for solving linear systems
- Separable programming. Theory and methods
- Limited memory restarted \(\ell^p\)-\(\ell^q\) minimization methods using generalized Krylov subspaces
- An inexact version of the symmetric proximal ADMM for solving separable convex optimization
