Gradient method: Difference between revisions

Revision as of 13:25, 8 April 2018

Revision as of 16:41, 9 April 2020

Line 1:

In [[optimization (mathematics)|optimization]], a '''gradient 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 methodmethods are the [[gradient descent]] and the [[conjugate gradient]].

==See also==