Improve-and-branch algorithm for the global optimization of nonconvex NLP problems (Q2494301)

From MaRDI portal
Revision as of 16:27, 24 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
Improve-and-branch algorithm for the global optimization of nonconvex NLP problems
scientific article

    Statements

    Improve-and-branch algorithm for the global optimization of nonconvex NLP problems (English)
    0 references
    0 references
    0 references
    0 references
    26 June 2006
    0 references
    concave terms
    0 references
    convex hull
    0 references
    underestimating problem
    0 references

    Identifiers