A logarithmic barrier cutting plane method for convex programming (Q1904709)

From MaRDI portal
Revision as of 10:47, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A logarithmic barrier cutting plane method for convex programming
scientific article

    Statements

    title
    A logarithmic barrier cutting plane method for convex programming (English)
    0 references
    author
    Dick den Hertog
    0 references
    Cornelis Roos
    0 references
    John A. Kaliski
    0 references
    Tamás Terlaky
    0 references
    publication date
    2 May 1996
    0 references
    zbMATH Keywords
    column generation
    0 references
    decomposition
    0 references
    interior point method
    0 references
    nonsmooth optimization
    0 references
    logarithmic barrier cutting plane algorithm
    0 references
    central path of a linear relaxation
    0 references
    cites work
    Q3932564
    0 references
    Q3858016
    0 references
    Q3208448
    0 references
    Q4296156
    0 references
    Q4840104
    0 references
    Q4206561
    0 references

    Identifiers

    DOI
    10.1007/BF02032162
    0 references
    Mathematics Subject Classification ID
    90C25
    0 references
    49J52
    0 references
    90C34
    0 references
    zbMATH DE Number
    830134
    0 references
    OpenAlex ID
    W2054876264
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1904709&oldid=37342749"
    Powered by MediaWiki