The following pages link to (Q3224801):
Displaying 8 items.
- A unified approach to interior point algorithms for linear complementary problems (Q1202150) (← links)
- An \((m+1)\)-step iterative method of convergence order \((m+2)\) for linear complementarity problems. An \((m+1)\)-step iterative method for LCPs (Q1676985) (← links)
- On hidden \(Z\)-matrix and interior point algorithm (Q2009197) (← links)
- Weighted LCPs and interior point systems for copositive linear transformations on Euclidean Jordan algebras (Q2423807) (← links)
- Using vector divisions in solving the linear complementarity problem (Q2428109) (← links)
- A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps (Q2657242) (← links)
- Polynomial interior point algorithms for general linear complementarity problems (Q2867373) (← links)
- An interior point approach for linear complementarity problem using new parametrized kernel function (Q5055297) (← links)
