Multiplicative iterative algorithms for convex programming (Q751770): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Paul P. B. Eggermont / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Thomas F. Coleman / rank
 
Normal rank

Revision as of 17:05, 10 February 2024

scientific article
Language Label Description Also known as
English
Multiplicative iterative algorithms for convex programming
scientific article

    Statements

    Multiplicative iterative algorithms for convex programming (English)
    0 references
    1990
    0 references
    The author considers the use of multiplicative iterative algorithms for the minimization of a differentiable convex function defined on the positive orthant. Such methods may be useful for very large-scale problems. Theoretical issues are considered but computational results are not provided.
    0 references
    convex programming
    0 references
    multiplicative iterative algorithms
    0 references
    large-scale problems
    0 references

    Identifiers