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...
Autors principals: | Simeon Reich, Hong-Kun Xu |
---|---|
Format: | Article |
Idioma: | English |
Publicat: |
Hindawi Limited
2003-01-01
|
Col·lecció: | Abstract and Applied Analysis |
Accés en línia: | http://dx.doi.org/10.1155/S1085337503212082 |
Ítems similars
-
Iterative Solution of Weighted Linear Least Squares Problems
per: Carp Doina, et al.
Publicat: (2020-07-01) -
Constrained least squares [mikrofis]
per: 175388 Mohd. Ruddin Abdul Ghani
Publicat: (1978) -
Implicit iterative algorithm for solving regularized total least squares problems
per: Dmitriy V. Ivanov, et al.
Publicat: (2022-06-01) -
Expanding the Applicability of Four Iterative Methods for Solving Least Squares Problems
per: Argyros Ioannis K., et al.
Publicat: (2017-12-01) -
Some iterative regularized methods for highly nonlinear least squares problems
per: Inga Kangro, et al.
Publicat: (2009-06-01)