A polynomial path-following interior point algorithm for general linear complementarity problems (Q989885): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-008-9348-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2167785353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient matrices and the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New criss-cross type algorithms for linear complementarity problems with sufficient matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear complementarity problem, sufficient matrices, and the criss- cross method / rank
 
Normal rank
Property / cites work
 
Property / cites work: LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: EP theorems and linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a subclass of \(P_ 0\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: EP theorem for dual linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for a class of linear complementarity problems / 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: Q4101610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_ *\)-matrices are just sufficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the handicap of a sufficient matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP / rank
 
Normal rank

Latest revision as of 03:27, 3 July 2024

scientific article
Language Label Description Also known as
English
A polynomial path-following interior point algorithm for general linear complementarity problems
scientific article

    Statements

    A polynomial path-following interior point algorithm for general linear complementarity problems (English)
    0 references
    0 references
    0 references
    0 references
    23 August 2010
    0 references
    0 references
    sufficient matrix
    0 references
    \({\mathcal{P}_*}\)-matrix
    0 references
    long-step method
    0 references
    0 references