Year: 2000
Author: Zi-Luan Wei
Journal of Computational Mathematics, Vol. 18 (2000), Iss. 2 : pp. 133–140
Abstract
A subspace search method for solving a class of least squares problem is presented in the paper. The original problem is divided into many independent subproblems, and a search direction is obtained by solving each of the subproblems, as well as a new iterative point is determined by choosing a suitable steplength such that the value of residual norm is decreasing. The convergence result is also given. The numerical test is also shown for a special problem.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2000-JCM-9029
Journal of Computational Mathematics, Vol. 18 (2000), Iss. 2 : pp. 133–140
Published online: 2000-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 8
Keywords: Subspace search method A class of least squares problem Convergence analysis.