A constrained optimization algorithm for total energy minimization in electronic structure calculations

Authors:
Chao Yang;Juan C. Meza;Lin-Wang Wang
Affiliations:
Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, CA;Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, CA;Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, CA
Venue:
Journal of Computational Physics
Year:
2006

Citing 6
Cited 2

On the limited memory BFGS method for large scale optimization

Mathematical Programming: Series A and B
LAPACK's user's guide

LAPACK's user's guide
A Jacobi--Davidson Iteration Method for Linear EigenvalueProblems

SIAM Journal on Matrix Analysis and Applications
The Geometry of Algorithms with Orthogonality Constraints

SIAM Journal on Matrix Analysis and Applications
Unconstrained energy functionals for electronic structure calculations

Journal of Computational Physics
Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method

SIAM Journal on Scientific Computing

KSSOLV—a MATLAB toolbox for solving the Kohn-Sham equations

ACM Transactions on Mathematical Software (TOMS)
Accelerated Block Preconditioned Gradient method for large scale wave functions calculations in Density Functional Theory

Journal of Computational Physics

Quantified Score

Hi-index	31.45

Visualization

Abstract

A new direct constrained optimization algorithm for minimizing the Kohn-Sham (KS) total energy functional is presented in this paper. The key ingredients of this algorithm involve projecting the total energy functional into a sequence of subspaces of small dimensions and seeking the minimizer of total energy functional within each subspace. The minimizer of a subspace energy functional not only provides a search direction along which the KS total energy functional decreases but also gives an optimal "step-length" to move along this search direction. Numerical examples are provided to demonstrate that this new direct constrained optimization algorithm can be more efficient than the self-consistent field (SCF) iteration.