The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming (Q3544257)

From MaRDI portal
Revision as of 22:05, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
scientific article

    Statements

    The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming (English)
    0 references
    0 references
    0 references
    5 December 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    semi-infinite programming
    0 references
    \(\alpha\)BB
    0 references
    global optimization
    0 references
    convex optimization
    0 references
    mathematical program with complementarity constraints
    0 references
    bilevel optimization
    0 references
    0 references
    0 references
    0 references