Norm-extended optimization

With these provisions the optimization process may proceed in analogy with any of the various schemes developed for nonrelativistic MCSCF. Jensen et al. (1996) have shown in detail how this may be done for one particular algorithm—the norm-extended optimization. The only added complication for the relativistic case arises from the need to use complex arithmetic. The implementation of time-reversal and doublegroup symmetry follows from the discussions of the symmetry of Fock matrices and of the relativistic many-electron Hamiltonian in earlier chapters. 

The examples just rehearsed indicate that in situations of asymmetrical indifference the committed norms, either of the hosts or the guests, may dictate an adjustment in an engineering outcome that is optimal from a design point of view. This is sufficient to show that neither the host nor the guest norms exclusively control the engineering decision context. We shall now extend these considerations... 

---