Gradient method: Difference between revisions

Revision as of 12:08, 10 February 2011

Revision as of 12:15, 10 February 2011

Line 1:

In [[optimization (mathematics)|optimization]], '''Gradientgradient method''' is an [[algorithm]] to solve problems of the form

:<math>\min_{x\in\mathbb R^n}\; f(x)</math>

with the search directions defined by the [[gradient]] of the function at the current point. Examples of gradient methodsmethod are the [[gradient descent]] and the [[conjugate gradient]].

==See also==