Minimization of functionals on the solution of a large-scale discrete ill-posed problem

DOI10.1007/S10543-012-0396-YMaRDI QIDQ1944012zbMATH OpenOpenAlexFDO

Authors D. 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

zbMATH Keywords

confidence intervalsnumerical examplesill-posed problemiterative methodleast squares problemslarge-scale problemstrust regionLanczos bidiagonalizationGauss-type quadrature rules

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Ill-posedness and regularization problems in numerical linear algebra (65F22)

Recommendations

• Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems
• Algorithms for the computation of functionals defined on the solution of a discrete ill-posed problem
• Projected Tikhonov regularization of large-scale discrete ill-posed problems
• Tikhonov regularization and the L-curve for large discrete ill-posed problems
• Confidence Intervals for Inequality-Constrained Least Squares Problems, with Applications to Ill-Posed Problems

Cites work

• scientific article; zbMATH DE number 1304508 (Why is no real title available?)
• scientific article; zbMATH DE number 554737 (Why is no real title available?)
• scientific article; zbMATH DE number 1058089 (Why is no real title available?)
• scientific article; zbMATH DE number 2107939 (Why is no real title available?)
• A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
• A new matrix-free algorithm for the large-scale trust-region subproblem
• Algorithm 873
• Algorithms for the computation of functionals defined on the solution of a discrete ill-posed problem
• Algorithms for the regularization of ill-conditioned least squares problems
• Confidence Intervals for Inequality-Constrained Least Squares Problems, with Applications to Ill-Posed Problems
• Estimation of the \(L\)-curve via Lanczos bidiagonalization
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Matrices, moments and quadrature with applications
• Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems
• Quadratically constrained least squares and quadratic problems
• Regularization tools version 4.0 for matlab 7.3
• Tikhonov Regularization with a Solution Constraint
• Tikhonov regularization and the L-curve for large discrete ill-posed problems
• \(L\)-curve curvature bounds via Lanczos bidiagonalization

Cited in

(6)

• On regularizing effects of MINRES and MR-II for large scale symmetric discrete ill-posed problems
• Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems
• On the computation of a truncated SVD of a large linear discrete ill-posed problem
• Generalized averaged Gauss quadrature rules for the approximation of matrix functionals
• Projected Tikhonov regularization of large-scale discrete ill-posed problems
• Algorithms for the computation of functionals defined on the solution of a discrete ill-posed problem

Describes a project that uses

Uses Software

• CRAIG
• OPQ
• LSTRS
• Regularization tools
• LSQR

This page was built for publication: Minimization of functionals on the solution of a large-scale discrete ill-posed problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944012)