Jump to content

Deterministic global optimization

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Meldraft (talk | contribs) at 14:38, 22 November 2015 (Created stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Deterministic global optimisation is a branch of numerical optimisation which focuses on finding the global solutions of an optimisation problem whilst providing theoretical guarantees that the reported solution is indeed the global one within some predefined tolerance.