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...
المؤلفون الرئيسيون: | , |
---|---|
التنسيق: | مقال |
اللغة: | English |
منشور في: |
Hindawi Limited
2003-01-01
|
سلاسل: | Abstract and Applied Analysis |
الوصول للمادة أونلاين: | http://dx.doi.org/10.1155/S1085337503212082 |