New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342)

From MaRDI portal
scientific article
Language Label Description Also known as
English
New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
scientific article

    Statements

    New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2008
    0 references
    For the problem of minimizing a quadratic indefinite form over a simplex known and new bounds for the optimal objective function value are derived. Main tools for this are semidefinite programming and the decomposition of the objective function into the difference of two convex functions. The different bounds are completely compared and a new bound is developed which dominates all the other bounds, especially also Shrijver's improvement of Lovasz's \(\theta\) function. Interesting results are also obtained with respect to the Lagrangean duality, where tight dual formulations are found. Special topics in this interesting and comprehensive paper are convex underestimation bounds, Nowak's bound and copositive as well as decomposition bounds.
    0 references
    quadratic programmig
    0 references
    nonconvex programming
    0 references
    semidefinite programming
    0 references
    bounds on optimal objective function value
    0 references
    Lovasz's \(\theta\)-function
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers