Hierarchical gradient methods for nonlinear LSQ problems
The author proposes a variant of the gradient algorithm that consists in a succession of cycles. On an iteration of the cycle, only a subset of the variables is changed; all variables must have changed at the end of a cycle. He applies his idea to nonlinear least squares problems.
scientific article; zbMATH DE number 399279
scientific article