An algorithm is proposed for the numerical solution of a quadratic minimization problem on an ellipsoid specified in the Hilbert space by a compact operator. This algorithm is a certain transform of the generalized residual method designed previously for the application in nonclassical information conditions when {\it a priori} information on the error level in an operator defining the cost functional is available only in the norms being weaker than the original ones. At the same time, the convergence of the algorithm is proved in the original norms. A number of simple numerical examples are discussed.

Keywords: ill-posed problem, quadratic minimization, ellipsoid, approximate data, generalized residual method.

• PDF (Full text in Russian, References in English)   (215KB)



• PDF. zip (Full text in Russian, References in English)   (186KB)