An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109)

From MaRDI portal
Revision as of 12:16, 19 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An infeasible interior-point algorithm for solving primal and dual geometric programs
scientific article

    Statements

    An infeasible interior-point algorithm for solving primal and dual geometric programs (English)
    0 references
    0 references
    23 July 1997
    0 references
    convex analysis
    0 references
    infeasible primal-dual algorithm
    0 references
    duality
    0 references
    numerical implementation
    0 references
    subfeasible solutions
    0 references
    posynomial geometric programming
    0 references
    sparse matrix factorizations
    0 references

    Identifiers