Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function (Q3051677): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-regular functions and new search directions for linear and semidefinite optimization / rank
 
Normal rank

Revision as of 10:04, 3 July 2024

scientific article
Language Label Description Also known as
English
Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function
scientific article

    Statements

    Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function (English)
    0 references
    0 references
    0 references
    5 November 2010
    0 references
    linear optimization
    0 references
    self-concordant function
    0 references
    finite barrier
    0 references
    interior-point methods
    0 references
    polynomial-time complexity
    0 references

    Identifiers