A class of polynomial primal-dual interior-point algorithms for semidefinite optimization (Q3415567): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Self-Scaled Cones / 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: Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank

Latest revision as of 11:41, 25 June 2024

scientific article
Language Label Description Also known as
English
A class of polynomial primal-dual interior-point algorithms for semidefinite optimization
scientific article

    Statements

    A class of polynomial primal-dual interior-point algorithms for semidefinite optimization (English)
    0 references
    19 January 2007
    0 references
    semidefinite optimization (SDO)
    0 references
    primal-dual interior-point methods
    0 references
    large- and small-update methods
    0 references
    polynomial complexity
    0 references
    0 references
    0 references

    Identifiers