Jump to content

αΒΒ

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Meldraft (talk | contribs) at 15:57, 23 March 2016 (Disambiguated: relaxationrelaxation (approximation)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.


αΒΒ is a second-order deterministic global optimization algorithm for finding the optima of general, twice continuously differentiable functions.[1][2] The algorithm is based around creating a relaxation for nonlinear functions of general form by superposing them with a quadratic of sufficient magnitude, called α, such that the resulting superposition is enough to overcome the worst-case scenario of non-convexity of the original function. Since a quadratic has a diagonal Hessian matrix, this superposition essentially adds a number to all diagonal elements of the original Hessian, such that the resulting Hessian is positive-semidefinite. Thus, the resulting relaxation is a convex function.

References

  1. ^ A global optimization approach for Lennard-Jones microclusters, The Journal of Chemical Physics, 1992, 97(10), 7667-7677
  2. ^ αBB: A global optimization method for general constrained nonconvex problems, Journal of Global Optimization, 1995, 7(4), 337-363