On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems
From MaRDI portal
Publication:268305
DOI10.1016/j.cam.2016.01.007zbMath1382.65114OpenAlexW2260337374WikidataQ58832716 ScholiaQ58832716MaRDI QIDQ268305
Germana Landi, Roberta De Asmundis, Daniela di Serafino
Publication date: 14 April 2016
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2016.01.007
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22)
Related Items
Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming, Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems, Gradient method with multiple damping for large-scale unconstrained optimization, On the steplength selection in gradient methods for unconstrained optimization, Shrinking gradient descent algorithms for total variation regularized image denoising, Fast gradient methods with alignment for symmetric linear systems without using Cauchy step, An efficient gradient method using the Yuan steplength, Modification of TV-ROF denoising model based on split Bregman iterations, Using gradient directions to get global convergence of Newton-type methods, A coordinate descent method for total variation minimization, A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables, ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration, On \(R\)-linear convergence analysis for a class of gradient methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved Newton projection method for nonnegative deblurring of Poisson-corrupted images with Tikhonov regularization
- An efficient gradient method using the Yuan steplength
- A limited memory steepest descent method
- On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
- Noise propagation in regularizing iterations for image deblurring
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
- New adaptive stepsize selections in gradient methods
- Algorithms for bound constrained quadratic programming problems
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Steepest descent, CG, and iterative regularization of ill-posed problems
- On the behavior of the gradient norm in the steepest descent method
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Analysis of monotone gradient methods
- AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
- On spectral properties of steepest descent methods
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- On the Identification Property of a Projected Gradient Method
- Deblurring Images
- Two-Point Step Size Gradient Methods
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Gradient Method with Retards and Generalizations
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Alternate minimization gradient method
- Computational Methods for Inverse Problems
- Gradient descent and fast artificial time integration
- Nonnegative least-squares image deblurring: improved gradient projection approaches
- On the filtering effect of iterative regularization algorithms for discrete inverse problems
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Image Processing and Analysis
- Non-negativity and iterative methods for ill-posed problems
