A weighted-path-following method for symmetric cone linear complementarity problems (Q478931): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5309480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3415802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Jordan-algebraic approach to potential-reduction algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear systems in Jordan algebras and primal-dual interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Jordan algebras and interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barrier Functions in Interior Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual target-following algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones / 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: Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of primal-dual interior point algorithms to symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Similarity and other spectral relations for symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization / rank
 
Normal rank

Revision as of 09:24, 9 July 2024

scientific article
Language Label Description Also known as
English
A weighted-path-following method for symmetric cone linear complementarity problems
scientific article

    Statements

    A weighted-path-following method for symmetric cone linear complementarity problems (English)
    0 references
    0 references
    5 December 2014
    0 references
    linear complementarity problem
    0 references
    full Nesterov-Todd step
    0 references
    weighted-path-following
    0 references
    polynomial complexity
    0 references

    Identifiers