A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems (Q2422131): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / 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 complementary problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems / 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
Property / cites work
 
Property / cites work: Improved infeasible-interior-point algorithm for linear complementarity problerns / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial interior-point algorithm for monotone linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrector-predictor methods for sufficient linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path / 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: An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On homogeneous and self-dual algorithms for LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of LCPs associated with positive definite symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039868 / rank
 
Normal rank

Latest revision as of 13:31, 19 July 2024

scientific article
Language Label Description Also known as
English
A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems
scientific article

    Statements

    A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems (English)
    0 references
    0 references
    0 references
    0 references
    18 June 2019
    0 references
    linear complementarity problems
    0 references
    predictor-corrector algorithm
    0 references
    polynomial complexity
    0 references
    0 references
    0 references

    Identifiers