An efficient logarithmic barrier method without line search for convex quadratic programming (Q5882851)

From MaRDI portal
Revision as of 10:01, 4 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7668672
Language Label Description Also known as
English
An efficient logarithmic barrier method without line search for convex quadratic programming
scientific article; zbMATH DE number 7668672

    Statements

    An efficient logarithmic barrier method without line search for convex quadratic programming (English)
    0 references
    0 references
    0 references
    29 March 2023
    0 references
    quadratic programming
    0 references
    linear programming
    0 references
    interior point methods
    0 references
    line search
    0 references
    approximate function
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references