Quadratic programming for positive solutions of linear inverse problems
This paper briefly reviews an approach for the solution of ill-posed linear inverse problems arising from the discretization of Fredholm integral equations of the first kind. The solution approach uses the truncated singular value decomposition (TSVD) and a priori constraints on the solution to recover an estimate of the solution in the presence of noisy data. More specifically, the information corresponding to the large singular values is used as it is done in the TSVD. In a second step, a minimization over the coefficients corresponding to the truncated singular spectrum is performed. In this minimization a priori constraints on the solution are enforced. The objective function is a (semi-)norm of the solution. For the entire collection see [Zbl 0910.00057].
This page was built for publication: Quadratic programming for positive solutions of linear inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4251284)
