A full-Newton step interior-point method for monotone weighted linear complementarity problems (Q2198532): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10957-020-01728-4 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Weighted Complementarity Problems---A New Paradigm for Computing Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point algorithms for a generalization of linear programming and weighted centring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A path to the Arrow-Debreu competitive market equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem / 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: Sufficient weighted complementarity problems / 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: A smoothing Newton algorithm for weighted linear complementarity problem / 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: Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3415802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5309541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5309480 / 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: Corrector-predictor methods for sufficient linear complementarity problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10957-020-01728-4 / rank
 
Normal rank

Latest revision as of 11:05, 17 December 2024

scientific article
Language Label Description Also known as
English
A full-Newton step interior-point method for monotone weighted linear complementarity problems
scientific article

    Statements

    A full-Newton step interior-point method for monotone weighted linear complementarity problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 September 2020
    0 references
    weighted complementarity
    0 references
    interior-point
    0 references
    path-following
    0 references
    full-Newton step
    0 references
    0 references
    0 references
    0 references

    Identifiers