Journal of Optimization Theory and Applications
Factorized quasi-Newton methods for nonlinear least squares problems
Mathematical Programming: Series A and B
An Adaptive Nonlinear Least-Squares Algorithm
ACM Transactions on Mathematical Software (TOMS)
Analyzing and improving quasi-newton methods for unconstrained optimization.
Analyzing and improving quasi-newton methods for unconstrained optimization.
Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
This paper is concerned with quadratic and superlinear convergence of structured quasi-Newton methods for solving nonlinear least squares problems. These methods make use of a special structure of the Hessian matrix of the objective function. Recently, Huschens proposed a new kind of structured quasi-Newton methods and dealt with the convex class of the structured Broyden family, and showed its quadratic and superlinear convergence properties for zero and nonzero residual problems, respectively. In this paper, we extend the results by Huschens to a wider class of the structured Broyden family. We prove local convergence properties of the method in a way different from the proof by Huschens.