Pencarian Nilai Minimum dengan Dua Dimensi pada Algoritma Gauss Newton

Abstract

Gauss-Newton algorithm is an iterative method used in solving the non-linear least- squares. As is known Gauss Newton algorithm does not always work forever, it can sometimes show weak to convergence rate. In this problem, used a two-dimensional searching strategies. The using of two-dimensional strategy will not be affected by the scale of the function or variable because the number of iterations is equal to a scaled version.