Computer programs occupation numbers

It is fair to say that neither of these two approaches works especially well N-representability conditions in the spatial representation are virtually unknown and the orbital-resolved computational methods are promising, but untested. It is interesting to note that one of the most common computational algorithms (cf. Eq. (96)) can be viewed as a density-matrix optimization, although most authors consider only a weak A -representability constraint on the occupation numbers of the g-matrix [1, 4, 69]. Additional A-representability constraints could, of course, be added, but it seems unlikely that the resulting g-density functional theory approach would be more efficient than direct methods based on semidefinite programming [33, 35-37]. 

---