journal article
oaidoi:10.1016/0898-1221(95)00229-4

The convergence speed of interval methods for global optimization

Authors
Publication date
31 March 1996
Publisher
Published by Elsevier Ltd.
Doi

    Abstract

    AbstractThree particular algorithms from a class of interval subdivision methods for global optimization are studied. The theoretical upper bound on the convergence speed of Hansen's method is given. The three methods (by Hansen, Moore-Skelboe, and a new one with a random actual box selection rule) are compared numerically

    Similar works

    Full text

    thumbnail-image

    Elsevier - Publisher Connector

    redirect
    oaidoi:10.1016/0898-1221(95)00229...
    Last time updated on 05/05/2017

    This paper was published in Elsevier - Publisher Connector .

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.