Mathematics of Operations Research, Vol. 12, No. 4 (Nov., 1987), pp. 678-699 (22 pages) We consider generalizations of the steepest descent algorithm for solving asymmetric systems of equations. We ...

In the setting of Hilbert spaces, we show that a hybrid steepest-descent algorithm converges strongly to a solution of a convex minimization problem over the fixed point set of a finite family of ...

Instead, the nonlinear regression algorithms implement some kind of iterative minimization process, often some variation on the method of steepest descent.