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...
Main Authors: | Simeon Reich, Hong-Kun Xu |
---|---|
Formato: | Artigo |
Idioma: | English |
Publicado em: |
Hindawi Limited
2003-01-01
|
Colecção: | Abstract and Applied Analysis |
Acesso em linha: | http://dx.doi.org/10.1155/S1085337503212082 |
Registos relacionados
-
Iterative Solution of Weighted Linear Least Squares Problems
Por: Carp Doina, et al.
Publicado em: (2020-07-01) -
Constrained least squares [mikrofis]
Por: 175388 Mohd. Ruddin Abdul Ghani
Publicado em: (1978) -
Implicit iterative algorithm for solving regularized total least squares problems
Por: Dmitriy V. Ivanov, et al.
Publicado em: (2022-06-01) -
Expanding the Applicability of Four Iterative Methods for Solving Least Squares Problems
Por: Argyros Ioannis K., et al.
Publicado em: (2017-12-01) -
Some iterative regularized methods for highly nonlinear least squares problems
Por: Inga Kangro, et al.
Publicado em: (2009-06-01)