Minimization of functionals on the solution of a large-scale discrete ill-posed problem
DOI10.1007/s10543-012-0396-yzbMath1262.65053OpenAlexW1994584133MaRDI QIDQ1944012
David R. Martin, Lothar Reichel
Publication date: 3 April 2013
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10543-012-0396-y
confidence intervalsnumerical examplesiterative methodill-posed problemleast squares problemsLanczos bidiagonalizationtrust regionlarge-scale problemsGauss-type quadrature rules
Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for the computation of functionals defined on the solution of a discrete ill-posed problem
- Quadratically constrained least squares and quadratic problems
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- \(L\)-curve curvature bounds via Lanczos bidiagonalization
- Estimation of the \(L\)-curve via Lanczos bidiagonalization
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems
- A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem
- Algorithm 873
- Confidence Intervals for Inequality-Constrained Least Squares Problems, with Applications to Ill-Posed Problems
- A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Algorithms for the regularization of ill-conditioned least squares problems
- Tikhonov Regularization with a Solution Constraint
This page was built for publication: Minimization of functionals on the solution of a large-scale discrete ill-posed problem