 - What is the difference between the Gauss–Newton algorithm and Newton's method? - an estimate of the full Hessian formula_80 is built up numerically using first derivatives formula_81 only so that after "n" refinement cycles the method closely approximates to Newton's method in performance. - Are there any other interesting aspects about this article? - Note that quasi-Newton methods can minimize general real-valued functions, whereas Gauss–Newton, Levenberg–Marquardt, etc. - What problems does it fit? - 

fits only to nonlinear least-squares problems.