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...
| Published in: | Abstract and Applied Analysis |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2003-01-01
|
| Online Access: | http://dx.doi.org/10.1155/S1085337503212082 |