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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2003-01-01
|
| Series: | Abstract and Applied Analysis |
| Online Access: | http://dx.doi.org/10.1155/S1085337503212082 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 resulting sequence is shown to converge strongly to the unique solution of the regularized problem. The net of the solutions to the regularized problems strongly converges to the minimum norm solution of the least squares problem if its solution set is nonempty. |
|---|---|
| ISSN: | 1085-3375 1687-0409 |