Seminar| Institute of Mathematical Sciences
Abstract: Tikhonov regularization is commonly applied to the solution of linear discrete ill-posed problems. In many applications the desired solution is known to be nonnegative. It is then natural to require that the approximate solution determined by Tikhonov regularization is also nonnegative. The present talk describes iterative methods, based on modulus methods, for computing nonnegative approximate solutions of Tikhonov regularization problems in general form. Methods suitable for small and large problems are discussed. Computed examples illustrate the performances of the methods considered.