摘要
A generalized nonlinear least squares problem is converted into two subproblems, and two new algorithms for these two subproblems are proposed. The superlinear convergence of the algorithms is proved even if the subproblem 1 is solved by the steepest descent method which is only linearly convergent, and some numerical examples are given, which also show the efficience of the algorithms.
A generalized nonlinear least squares problem is converted into two subproblems, and two new algorithms for these two subproblems are proposed. The superlinear convergence of the algorithms is proved even if the subproblem 1 is solved by the steepest descent method which is only linearly convergent, and some numerical examples are given, which also show the efficience of the algorithms.
出处
《计算数学》
CSCD
北大核心
1997年第1期39-46,共8页
Mathematica Numerica Sinica
