Gauss-Newton algorithm 2026-10-31
For nonlinear least squares , with residual Jacobian matrix , the method approximates the Hessian by . The exact Hessian is . Full column rank of makes the approximation positive definite. At a zero-residual solution with full-rank Jacobian, , so any convergent sequence of full Gauss-Newton steps satisfies the Dennis-Moré condition and converges superlinearly. A nonzero residual at the solution leaves a generally nonvanishing discarded Hessian term; the same conclusion does not follow automatically.
A quasi-Newton method replaces the Hessian in the Newton system by an efficiently updated approximation :
The matrices must be nonsingular for the step to exist. Symmetry reflects the true Hessian, and positive definiteness makes every nonzero step a descent direction, since . Secant updates often enforce the Quasi-Newton secant equation .
Q-superlinear convergence means , unless the sequence terminates exactly. A sufficient Dennis-Moré condition is
assuming , , continuous Hessian near and nonsingular . Only accuracy on the actual step direction is required; full matrix convergence is sufficient but stronger.
To prove the assertion, continuity of the Hessian along the short segment from to gives
Nonsingularity of and give a constant with near zero. Writing , we obtain
Thus . This proves sufficiency. It is a local rate result for an already convergent sequence, not a claim that arbitrary unmodified quasi-Newton iterations converge from every starting point.
Put , with one residual gradient per row. The chain rule gives
Differentiating each product gives
The approximation defines the Gauss-Newton method. It is symmetric, and full column rank gives for , so the step is well-defined.
If , and has full column rank, then and is positive definite. Continuity of gives . Therefore
The Dennis-Moré condition applies, proving , or finite termination. The zero-residual hypothesis is what makes the discarded second-derivative term vanish at the limit.