Global optimization
Data Structures and Algorithms
Data Structures and Algorithms
Application of Deterministic Low-Discrepancy Sequences in Global Optimization
Computational Optimization and Applications
Linearity Embedded in Nonconvex Programs
Journal of Global Optimization
An Exact Reformulation Algorithm for Large Nonconvex NLPs Involving Bilinear Terms
Journal of Global Optimization
Branching and bounds tighteningtechniques for non-convex MINLP
Optimization Methods & Software - GLOBAL OPTIMIZATION
On convex relaxations of quadrilinear terms
Journal of Global Optimization
Relaxations of multilinear convex envelopes: dual is better than primal
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Deterministic global optimization in ab-initio quantum chemistry
Journal of Global Optimization
Hi-index | 0.04 |
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.