An iterative approach to a constrained least squares problem
A constrained least squares problem in a Hilbert space H is considered. The standard Tikhonov regularization method is used. In the case where the set of the constraints is the nonempty intersection of a finite collection of closed convex subsets of H, an iterative algorithm is designed. The result...
المؤلفون الرئيسيون: | Simeon Reich, Hong-Kun Xu |
---|---|
التنسيق: | مقال |
اللغة: | English |
منشور في: |
Hindawi Limited
2003-01-01
|
سلاسل: | Abstract and Applied Analysis |
الوصول للمادة أونلاين: | http://dx.doi.org/10.1155/S1085337503212082 |
مواد مشابهة
-
Iterative Solution of Weighted Linear Least Squares Problems
حسب: Carp Doina, وآخرون
منشور في: (2020-07-01) -
Constrained least squares [mikrofis]
حسب: 175388 Mohd. Ruddin Abdul Ghani
منشور في: (1978) -
Implicit iterative algorithm for solving regularized total least squares problems
حسب: Dmitriy V. Ivanov, وآخرون
منشور في: (2022-06-01) -
Expanding the Applicability of Four Iterative Methods for Solving Least Squares Problems
حسب: Argyros Ioannis K., وآخرون
منشور في: (2017-12-01) -
Some iterative regularized methods for highly nonlinear least squares problems
حسب: Inga Kangro, وآخرون
منشور في: (2009-06-01)