Global convergence of a regularized factorized quasi-Newton method for nonlinear least squares problems

26Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we propose a regularized factorized quasi-Newton method with a new Armijo-type line search and prove its global convergence for nonlinear least squares problems. This convergence result is extended to the regularized BFGS and DFP methods for solving strictly convex minimization problems. Some numerical results are presented to show efficiency of the proposed method. © 2010 SBMAC.

Cite

CITATION STYLE

APA

Zhou, W., & Zhang, L. (2010). Global convergence of a regularized factorized quasi-Newton method for nonlinear least squares problems. Computational and Applied Mathematics, 29(2), 195–214. https://doi.org/10.1590/S1807-03022010000200006

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free