The generalized Gauss–Newton method is a generalization of the least-squares method originally described by
Carl Friedrich Gauss and of
Newton's method
In numerical analysis, Newton's method, also known as the Newton–Raphson method, named after Isaac Newton and Joseph Raphson, is a root-finding algorithm which produces successively better approximations to the roots (or zeroes) of a real-valu ...
due to
Isaac Newton to the case of constrained nonlinear least-squares problems.
[.]
References
Numerical analysis
{{applied-math-stub