ON QUADRATICAL CONVERGENCE OF INEXACT LEVENBERG-MARQUARDT METHODS UNDER LOCAL ERROR BOUND CONDITION

被引:0
作者
Zhang, Yan [1 ]
Yu, Carisa Kwok Wai [2 ]
Bao, Ji-Feng [3 ,4 ]
Wang, Jinhua [5 ]
机构
[1] Zhejiang Univ Water Resources & Elect Power, Hangzhou 310018, Zhejiang, Peoples R China
[2] Hang Seng Management Coll, Dept Math & Stat, Hong Kong, Hong Kong, Peoples R China
[3] Zhejiang Ocean Univ, Sch Math Phys & Informat Sci, Zhoushan 316022, Zhejiang, Peoples R China
[4] Key Lab Oceanog Big Data Min & Applicat Zhejiang, Zhoushan 316022, Zhejiang, Peoples R China
[5] Zhejiang Univ Technol, Dept Math, Hangzhou 310032, Zhejiang, Peoples R China
基金
中国国家自然科学基金;
关键词
Nonlinear least squares problems; inexact Levenberg-Marquardt method; Lipschitz condition; local error bound; GAUSS-NEWTON-METHOD; CONVEX COMPOSITE OPTIMIZATION; LEAST-SQUARES PROBLEMS; WEAK SHARP MINIMA; SYSTEMS; POLYNOMIALS; DERIVATIVES; ALGORITHM; EQUATIONS; 4D-VAR;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In the present paper, we propose a new inexact Levenberg-Marquardt method (LMM) with different residual. Under a local error bound condition which is same as given by [Optim. Methods Softw. 17 (2002), 605-626], we show that a sequence generated by the new inexact LMM converges to a solution of f(x) = 0 superlinearly and even quadratically for some special parameters, while in [Optim. Methods Softw. 17 (2002), 605-626], it's just showed that d(x(k), S) converges to 0 superlinearly or quadratically, where S is the solution set of f(x) = 0. Hence, our results improve the corresponding results in [Optim. Methods Softw. 17 (2002), 605-626]. Furthermore, we also propose the global version of the new inexact LMM by virtue of the Armijo, Wolfe or Goldstein line-search schemes, and establish its global quadratical convergence under the local error bound condition. Finally, numerical results have also been provided.
引用
收藏
页码:123 / 146
页数:24
相关论文
共 53 条
[1]  
[Anonymous], 1990, Matrix Perturbation Theory, Computer Science and Scientific Computing
[2]  
[Anonymous], 1999, SPRINGER SCI
[3]  
[Anonymous], 1970, ITERATIVE SOLUTION N
[4]  
[Anonymous], 1995, NONLINEAR PROGRAMMIN
[6]  
Bao J. F., COMPUT OPTIM A UNPUB
[7]   Approximate Gauss-Newton methods for solving underdetermined nonlinear least squares problems [J].
Bao, Ji-Feng ;
Li, Chong ;
Shen, Wei-Ping ;
Yao, Jen-Chih ;
Guu, Sy-Ming .
APPLIED NUMERICAL MATHEMATICS, 2017, 111 :92-110
[8]   A Levenberg-Marquardt method with approximate projections [J].
Behling, R. ;
Fischer, A. ;
Herrich, M. ;
Iusem, A. ;
Ye, Y. .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2014, 59 (1-2) :5-26
[9]  
Ben-Israel Adi, 1974, GEN INVERSE THEORY A
[10]  
Bjork A., 1996, NUMERICAL METHODS LE