http://debianws.lexgopc.com/wiki143/index.php?action=history&feed=atom&title=Gradient_method 2026-10-26T16:38:34Z Revision history for this page on the wiki MediaWiki 1.43.1 http://debianws.lexgopc.com/wiki143/index.php?title=Gradient_method&diff=6049957&oldid=prev 2022-04-17T05:36:20Z

<p></p> <p><b>New page</b></p><div>In [[optimization (mathematics)|optimization]], a &#039;&#039;&#039;gradient method&#039;&#039;&#039; is an [[algorithm]] to solve problems of the form <br /> <br /> :&lt;math&gt;\min_{x\in\mathbb R^n}\; f(x)&lt;/math&gt;<br /> <br /> with the search directions defined by the [[gradient]] of the function at the current point. Examples of gradient methods are the [[gradient descent]] and the [[conjugate gradient]].<br /> <br /> ==See also==<br /> {{div col|colwidth=22em}}<br /> * [[Gradient descent]]<br /> * [[Stochastic gradient descent]]<br /> * [[Coordinate descent]]<br /> * [[Frank–Wolfe algorithm]]<br /> * [[Landweber iteration]]<br /> * [[Random coordinate descent]]<br /> * [[Conjugate gradient method]]<br /> * [[Derivation of the conjugate gradient method]]<br /> * [[Nonlinear conjugate gradient method]]<br /> * [[Biconjugate gradient method]]<br /> * [[Biconjugate gradient stabilized method]]<br /> {{div col end}}<br /> <br /> ==References==<br /> * {{cite book | year=1997 | title=Optimization : Algorithms and Consistent Approximations<br /> | publisher=Springer-Verlag | isbn=0-387-94971-2 |author=Elijah Polak}}<br /> {{Optimization algorithms}}<br /> <br /> {{DEFAULTSORT:Gradient Method}}<br /> [[Category:First order methods]]<br /> [[Category:Optimization algorithms and methods]]<br /> [[Category:Numerical linear algebra]]<br /> [[Category:Gradient methods| ]]<br /> <br /> {{linear-algebra-stub}}</div>

imported>Sumanuil