Pages that link to "Item:Q1696438"
From MaRDI portal
The following pages link to Comparison of three classes of algorithms for the solution of the linear complementarity problem with an \(H_+\)-matrix (Q1696438):
Displayed 10 items.
- The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix (Q781116) (← links)
- On the equivalence between some projected and modulus-based splitting methods for linear complementarity problems (Q2009765) (← links)
- Modulus-based multisplitting iteration method for a class of weakly nonlinear complementarity problem (Q2077781) (← links)
- A generalization of the equivalence relations between modulus-based and projected splitting methods (Q2084585) (← links)
- A class of new modulus-based matrix splitting methods for linear complementarity problem (Q2136881) (← links)
- The reduced order method for solving the linear complementarity problem with an \(M\)-matrix (Q2172919) (← links)
- A numerical method based on the complementarity and optimal control formulations for solving a family of zero-sum pursuit-evasion differential games (Q2292014) (← links)
- A TWO-STEP MODULUS-BASED MULTISPLITTING ITERATION METHOD FOR THE NONLINEAR COMPLEMENTARITY PROBLEM (Q5858055) (← links)
- AN IMPROVED BLOCK MODULUS METHOD FOR DIAGONALLY DOMINANT LINEAR COMPLEMENTARITY PROBLEMS (Q5868478) (← links)
- A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems (Q6166658) (← links)
