Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem (Q376771): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s12543-009-0033-x / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q5309480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new primal-dual path-following method for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivaence between different formulations of the linear complementarity promblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5309541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3415802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast convergence of the simplified largest step path following algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The largest step path following algorithm for monotone linear complementarity problems / 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 unified approach to interior point algorithms for linear complementarity problems: A summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S12543-009-0033-X / rank
 
Normal rank

Latest revision as of 15:45, 9 December 2024

scientific article
Language Label Description Also known as
English
Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem
scientific article

    Statements

    Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem (English)
    0 references
    0 references
    0 references
    0 references
    19 November 2013
    0 references
    mixed linear complementarity problem
    0 references
    interior-point methods
    0 references
    smallupdate method
    0 references
    iteration bound
    0 references

    Identifiers