5.15.2. minimizer.cg

eminus.minimizer.cg(scf, Nit, cost=scf_step, grad=get_grad, condition=check_convergence, betat=3e-5, cgform=1)[source]

Conjugate-gradient minimization algorithm.

Parameters:
  • scf – SCF object.

  • Nit – Maximum number of SCF steps.

Keyword Arguments:
  • cost – Function that will run every SCF step.

  • grad – Function that calculates the respective gradient.

  • condition – Function to check and log the convergence condition.

  • betat – Step size.

  • cgform – Conjugate gradient form.

Returns:

Total energies per SCF cycle.