An iterative algorithm for large size least-squares constrained regularization problems

DOI10.1016/j.amc.2011.04.086zbMath1228.65061OpenAlexW2036456224MaRDI QIDQ555485

Elena Loli Piccolomini, Fabiana Zama

Publication date: 22 July 2011

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.04.086

zbMATH Keywords

algorithmregularizationconstrained optimizationnumerical experimentsiterative methodsleast squarescomputational efficiencyinverse ill-posed problems

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

An automatic regularization parameter selection algorithm in the total variation model for image deblurring ⋮ The conjugate gradient regularization method in computed tomography problems

Uses Software

• Regularization tools
• LSTRS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The discrete Picard condition for discrete ill-posed problems
• A weighted-GCV method for Lanczos-hybrid regularization
• Trust-region and other regularisations of linear least-squares problems
• Quadratically constrained least squares and quadratic problems
• Solving quadratically constrained least squares using black box solvers
• Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
• Iterative exponential filtering for large discrete ill-posed problems
• Algorithm 873
• Rank-Deficient and Discrete Ill-Posed Problems
• Computational Methods for Inverse Problems

This page was built for publication: An iterative algorithm for large size least-squares constrained regularization problems