New methods for calculating α BB-type underestimators

Anders Skjäl, Tapio Westerlund

    Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

    15 Citeringar (Scopus)

    Sammanfattning

    Most branch-and-bound algorithms in global optimization depend on convex underestimators to calculate lower bounds of a minimization objective function. The BB methodology produces such underestimators for sufficiently smooth functions by analyzing interval Hessian approximations. Several methods to rigorously determine the BB parameters have been proposed, varying in tightness and computational complexity. We present new polynomial-time methods and compare their properties to existing approaches. The new methods are based on classical eigenvalue bounds from linear algebra and a more recent result on interval matrices. We show how parameters can be optimized with respect to the average underestimation error, in addition to the maximum error commonly used in BB methods. Numerical comparisons are made, based on test functions and a set of randomly generated interval Hessians. The paper shows the relative strengths of the methods, and proves exact results where one method dominates another.
    OriginalspråkOdefinierat/okänt
    Sidor (från-till)411–427
    Antal sidor17
    TidskriftJournal of Global Optimization
    Volym58
    Utgåva3
    DOI
    StatusPublicerad - 2014
    MoE-publikationstypA1 Tidskriftsartikel-refererad

    Nyckelord

    • alpha BB
    • Convex relaxation
    • Global optimization
    • Nonconvex optimization

    Citera det här