Abstract
Optimization algorithms play a central role in chemistry since optimization is the computational keystone of most molecular and electronic structure calculations. Herein, we introduce the iterative power algorithm (IPA) for global optimization and a formal proof of convergence for both discrete and continuous global search problems, which is essential for applications in chemistry such as molecular geometry optimization. IPA implements the power iteration method in quantics tensor train (QTT) representations. Analogous to the imaginary time propagation method with infinite mass, IPA starts with an initial probability distribution rho(0)(x) and iteratively applies the recurrence relation rho(k+1)(x) = U(x) rho(k)(x)/parallel to U rho(k)parallel to(L1), where U(x) = e(-V(x)) is defined in terms of the potential energy surface (PES) V(x) with global minimum at x = x*. Upon convergence, the probability distribution becomes a delta function delta(x - x*), so the global minimum can be obtained as the position expectation value x* = Tr[x delta(x - x*)]. QTT representations of V(x) and rho(x) are generated by fast adaptive interpolation of multidimensional arrays to bypass the curse of dimensionality and the need to evaluate V(x) for all possible values of x. We illustrate the capabilities of IPA for global search optimization of two multidimensional PESs, including a differentiable model PES of a DNA chain with D = 50 adenine-thymine base pairs, and a discrete non-differentiable potential energy surface, V(p) = mod(N,p), that resolves the prime factors of an integer N, with p in the space of prime numbers {2, 3,..., p(max)} folded as a d-dimensional 2(1) x 2(2) x ... x 2(d) tensor. We find that IPA resolves multiple degenerate global minima even when separated by large energy barriers in the highly rugged landscape of the potentials. Therefore, IPA should be of great interest for a wide range of other optimization problems ubiquitous in molecular and electronic structure calculations.