Reformulation in mathematical programming: An application to quantum chemistry

This paper concerns the application of reformulation techniques in mathematical programming to a specific problem arising in quantum chemistry, namely the solution of Hartree-Fock systems of equations, which describe atomic and molecular electronic wave functions based on the minimization of a functional of the energy. Their traditional solution method does not provide a guarantee of global optimality and its output depends on a provided initial starting point. We formulate this problem as a multi-extremal nonconvex polynomial programming problem, and solve it with a spatial Branch-and-Bound algorithm for global optimization. The lower bounds at each node are provided by reformulating the problem in such a way that its convex relaxation is tight. The validity of the proposed approach was established by successfully computing the ground-state of the helium and beryllium atoms.

[1]  Nelson Maculan,et al.  Solving Hartree-Fock systems with global optimization methods , 2007 .

[2]  Edward M. B. Smith,et al.  Global optimisation of nonconvex MINLPs , 1997 .

[3]  Leo Liberti.  Linearity Embedded in Nonconvex Programs , 2005, J. Glob. Optim..

[4]  Lonnie Hamm,et al.  GLOBAL OPTIMIZATION METHODS , 2002 .

[5]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[6]  Mirjana Cangalovic,et al.  Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search , 2003, Eur. J. Oper. Res..

[7]  Sergei S. Kucherenko,et al.  Application of Deterministic Low-Discrepancy Sequences in Global Optimization , 2005, Comput. Optim. Appl..

[8]  David Feller,et al.  Basis Sets for Ab Initio Molecular Orbital Calculations and Intermolecular Interactions , 2007 .

[9]  Leo Liberti,et al.  Variable Neighbourhood Search for the Global Optimization of Constrained NLPs , 2006 .

[10]  N. Maculan,et al.  Global optimization : from theory to implementation , 2006 .

[11]  Leo Liberti,et al.  Reduction constraints for the global optimization of NLPs , 2004 .

[12]  Leo Liberti,et al.  Writing Global Optimization Software , 2006 .

[13]  Aimo A. Törn,et al.  Global Optimization , 1999, Science.

[14]  A. Neumaier,et al.  A global optimization method, αBB, for general twice-differentiable constrained NLPs — I. Theoretical advances , 1998 .

[15]  Warren P. Adams,et al.  A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .

[16]  James E. Falk,et al.  Jointly Constrained Biconvex Programming , 1983, Math. Oper. Res..

[17]  Garth P. McCormick,et al.  Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..

[18]  E. L. Short,et al.  Quantum Chemistry , 1969, Nature.

[19]  Leo Liberti,et al.  An Exact Reformulation Algorithm for Large Nonconvex NLPs Involving Bilinear Terms , 2006, J. Glob. Optim..

[20]  Hanif D. Sherali,et al.  A new reformulation-linearization technique for bilinear programming problems , 1992, J. Glob. Optim..