An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term (Q2303523)

From MaRDI portal
Revision as of 00:54, 22 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
scientific article

    Statements

    An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term (English)
    0 references
    0 references
    4 March 2020
    0 references
    linear optimization
    0 references
    interior-point methods
    0 references
    iteration complexity
    0 references
    finite barrier function
    0 references
    large-update methods
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers