A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950)

From MaRDI portal
Revision as of 11:40, 10 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
scientific article

    Statements

    A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (English)
    0 references
    0 references
    14 June 2005
    0 references
    Nonconvex quadratic programming
    0 references
    Global optimization
    0 references
    Convex envelope
    0 references
    Branch-and-bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers