A simplicial branch-and-bound method for solving nonconvex all-quadratic programs (Q1281481)

From MaRDI portal
Revision as of 11:01, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
scientific article

    Statements

    A simplicial branch-and-bound method for solving nonconvex all-quadratic programs (English)
    0 references
    0 references
    21 July 1999
    0 references
    global optimization
    0 references
    indefinite quadratic optimization under indefinite quadratic constraints
    0 references
    nonconvex quadratically constrained quadratic programs
    0 references
    branch-and-bound
    0 references
    \(\varepsilon\)-approximate optimal solution
    0 references

    Identifiers