Predictive Mixing for Density Functional Theory (and other Fixed-Point Problems)

Abstract

Density functional theory calculations use a significant fraction of current supercomputing time. The resources required scale with the problem size, internal workings of the code and the number of iterations to convergence, the latter being controlled by what is called mixing. This note describes a new approach to handling trust-regions within these and other fixed-point problems. Rather than adjusting the trust-region based upon improvement, the prior steps are used to estimate what the parameters and trust-regions should be, effectively estimating the optimal Polyak step from the prior history. Detailed results are shown for eight structures using both the Good and Bad Multisecant versions as well as Anderson and a hybrid approach, all with the same predictive method. Additional comparisons are made for thirty-six cases with fixed algorithm Greed The predictive method works well independent of which method is used for the candidate step, and is capable of adapting to different problem types particularly when coupled with the hybrid approach. It would be premature to claim that it is the best possible approach, but the results suggest that it may be.

References in corpus (15)

• Force calculation and atomic-structure optimization for the full-potential linearized augmented plane-wave code WIEN
• Periodic Pulay method for robust and efficient convergence acceleration of self-consistent field iterations
• Kohn-Sham calculations with the exact functional
• Robust Mixing for Ab-Initio Quantum Mechanical Calculations
• Computing the Self-Consistent Field in Kohn-Sham Density Functional Theory
• Guaranteed convergence of the Kohn-Sham equations
• Guaranteed Convergence of a Regularized Kohn-Sham Iteration in Finite Dimensions
• Applicability of Kerker preconditioning scheme to the self-consistent density functional theory calculations of inhomogeneous systems
• On preconditioning the self-consistent field iteration in real-space Density Functional Theory
• Black-box inhomogeneous preconditioning for self-consistent field iterations in density functional theory
• On the equivalence of LIST and DIIS methods for convergence acceleration
• Enhancing structure relaxations for first-principles codes: an approximate Hessian approach
• Existence of minimizers for Kohn-Sham within the Local Spin Density Approximation
• On the Nature of Self-Consistency in Density Functional Theory
• Existence of Minimizers in Restricted Hartree-Fock Theory

Cited by in corpus (2)

• A robust and efficient line search for self-consistent field iterations
• Resta-like preconditioning for self-consistent field iterations in the linearized augmented planewave method