 Font Size: a A A

# Nonlinear Least Squares Gauss-newton The-mbfgs Law

Posted on:2004-10-04Degree:MasterType:Thesis
Country:ChinaCandidate:F WangFull Text:PDF
GTID:2190360092490489Subject:Computational Mathematics
Abstract/Summary: PDF Full Text Request
The structured BFGS method is a quasi-Newton method for solving the nonlinear least squares problem. It exploits the structured of the Hessian matrix of the objective function sufficiently. An attractive property of the structured BFGS method is its local superlinear/quadratic convergence property for the nonzero/zero residual problems. The local convergence of the structured BFGS method has been well established. However, so far, no theory has been established for the global convergence of the method. The main difficulty for the global convergence of the structured BFGS method lies in that the matrices generated by the method may not be positive definite. As a consequent, the direction generated by the method may not be a descent direction of the objective function. Although there have been some suggestions on how to ensure the positive definiteness of the iterative matrices, they are restrictive and is not easy to be implemented. In this thesis, by using a modified BFGS update formula, we develop a modified structured BFGS (MBFGS) method. An advantage of the proposed method is that the generated iterative matrices are always positive definite. This property is independent with the convexity of the objective function and the line search used. Therefore, the generated directions are descent directions of the objective function. By means of a backtracking line search, we develop a globalized structured MBFGS method for solving the nonlinear least squares problem. Under mild conditions, we prove that the proposed method is globally convergent. Moreover, we show that after finite iterations, the unit step is always accepted, and the method locally reduces to the modified BFGS method. Consequently, the convergence rate of the proposed method is superlinear. To speed up the method, we combine the structured MBFGS method with Gauss-Newton method to propose a hybrid method. We show that the hybrid method is globally and superlinearly convergent for nonzero residual problems and globally and quadratically for zero residual problems. We also do some numerical experiments to test the proposed method. The reported results show that the proposed method performs quite well for the tested problems.
Keywords/Search Tags:least squares problem, structured BFGS method, Guass-Newton method, global convergence, superlinear convergence, quadratic convergence PDF Full Text Request
Related items
 1 For Solving Nonlinear Least Squares Problem, A New Class Of Decomposition Of The Quasi-newton Method 2 Based On The New Quasi-newton Equation Improved Bfgs Method 3 A New Method For Solving Nonlinear Least Squares Problem 4 For Solving Nonlinear Constrained Optimization Problems Modified Bfgs Method 5 Broyden's Class Of Modified Quasi-Newton Methods And Their Applications 6 Definite Algorithm Based On The New Quasi-newton Equation For A Class Of Forced Convergence Analysis 7 For Solving Nonlinear The Pathological Equations Of A Modified Newton Method And Its Applications 8 A New Class Of Quasi-newton Algorithm And Its Convergence 9 A New Class Of Quasi-newton Algorithm And Its Convergence 10 Multiplier Methods For Complementarity Problems