Conjugate gradient optimization

From VASP Wiki
Revision as of 10:48, 6 April 2022 by Huebsch (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Instead of the previous iteration scheme, which is just some kind of Quasi-Newton scheme, it also possible to optimize the expectation value of the Hamiltonian using a successive number of conjugate gradient steps. The first step is equal to the steepest descent step in section Single band steepest descent scheme. In all following steps the preconditioned gradient is conjugated to the previous search direction. The resulting conjugate gradient algorithm is almost as efficient as the algorithm given in Efficient single band eigenvalue-minimization. For further reading see [1][2][3].

References