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 Muller-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 et al., J. Chem. Phys. 122, 204102 (2005)]. This is due to the fact that the BBk functionals are not proper functionals of the density matrix.
No takes yet. Share an insight, caveat, or question.
Cancès et al. (2008) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: