Difference between revisions of "Gradient descent"
Miguel Caro (talk | contribs) (Created page with "Gradient descent is a method for finding extrema of a function by following the direction of fastest change in said function, i.e., its gradient. For energy minimization,...") |
Miguel Caro (talk | contribs) m |
||
| Line 2: | Line 2: | ||
<math> | <math> | ||
\textbf{x}_{n+1} = \textbf{x}_n + \gamma_n \textbf{F}_n, | \textbf{x}_{n+1} = \textbf{x}_n + \gamma_n \textbf{F}_n, | ||
| − | <math> | + | </math> |
until we reach the criterion for convergence (set with the <code>[[e_tol]]</code> keyword), <math>|E_{n+1} - E_n| < E_\text{tol}</math>. The <math>\gamma</math> parameter determines by how much we update the atomic positions along the search direction, and is allowed to change between iterations. In '''TurboGAP''', the initial $\gamma$ is chosen by specifying the maximum allowed atomic displacement in the first optimization step, [[max_opt_step]], followed by an automated backtracking line search. | until we reach the criterion for convergence (set with the <code>[[e_tol]]</code> keyword), <math>|E_{n+1} - E_n| < E_\text{tol}</math>. The <math>\gamma</math> parameter determines by how much we update the atomic positions along the search direction, and is allowed to change between iterations. In '''TurboGAP''', the initial $\gamma$ is chosen by specifying the maximum allowed atomic displacement in the first optimization step, [[max_opt_step]], followed by an automated backtracking line search. | ||
'''Under construction''' | '''Under construction''' | ||
Revision as of 16:22, 31 October 2021
Gradient descent is a method for finding extrema of a function by following the direction of fastest change in said function, i.e., its gradient. For energy minimization, we follow the direction corresponding to minus the gradient, that is, we update the atomic positions along the direction given by the forces. Iteratively, we propagate the atomic positions as follows:
[math]\displaystyle{
\textbf{x}_{n+1} = \textbf{x}_n + \gamma_n \textbf{F}_n,
}[/math]
until we reach the criterion for convergence (set with the e_tol keyword), [math]\displaystyle{ |E_{n+1} - E_n| \lt E_\text{tol} }[/math]. The [math]\displaystyle{ \gamma }[/math] parameter determines by how much we update the atomic positions along the search direction, and is allowed to change between iterations. In TurboGAP, the initial $\gamma$ is chosen by specifying the maximum allowed atomic displacement in the first optimization step, max_opt_step, followed by an automated backtracking line search.
Under construction
