TY - JOUR
T1 - Subspace Search Method for a Class of Least Squares Problem
AU - Wei , Zi-Luan
JO - Journal of Computational Mathematics
VL - 2
SP - 133
EP - 140
PY - 2000
DA - 2000/04
SN - 18
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jcm/9029.html
KW - Subspace search method, A class of least squares problem, Convergence analysis.
AB - <p style="text-align: justify;">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. &nbsp;</p>