A sequential cutting plane algorithm for solving convex NLP problems (Q2496070)

From MaRDI portal
Revision as of 01:09, 19 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A sequential cutting plane algorithm for solving convex NLP problems
scientific article

    Statements

    A sequential cutting plane algorithm for solving convex NLP problems (English)
    0 references
    0 references
    0 references
    30 June 2006
    0 references
    convex programming
    0 references
    nonlinear programming
    0 references
    cutting plane algorithms
    0 references
    sequential linear programming
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers