Abstract
We present projected gradient algorithms designed for optimizing various functionals defined on the set of N -representable one-electron reduced density matrices. We show that projected gradient algorithms are efficient in minimizing the Hartree-Fock or the Müller-Buijse-Baerends functional. On the other hand, they converge very slowly when applied to the recently proposed BBk (k=1,2,3) functionals [O. Gritsenko, J. Chem. Phys. 122, 204102 (2005)]. This is due to the fact that the BBk functionals are not proper functionals of the density matrix.
| Original language | English |
|---|---|
| Article number | 134108 |
| Journal | Journal of Chemical Physics |
| Volume | 128 |
| Issue number | 13 |
| DOIs | |
| Publication status | Published - 14 Apr 2008 |