An iterative approach to a constrained least squares problem

Simeon Reich and Hong-Kun Xu

Abstract and Applied Analysis, 2003, vol. 2003, issue 8, 503-512

Abstract: 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.

Date: 2003
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/S1085337503212082

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnlaaa:v:2003:y:2003:i:8:p:503-512

Access Statistics for this article

More articles in Abstract and Applied Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().