Pages that link to "Item:Q2428109"
From MaRDI portal
The following pages link to Using vector divisions in solving the linear complementarity problem (Q2428109):
Displayed 8 items.
- A new smoothing nonlinear conjugate gradient method for nonsmooth equations with finitely many maximum functions (Q370203) (← links)
- A generalized Newton method of high-order convergence for solving the large-scale linear complementarity problem (Q903210) (← 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)
- Interrelationships between prey and predators and how predators choose their prey to maximize their utility functions (Q2034691) (← links)
- A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps (Q2657242) (← links)
- A representation of the solution set of a class of linear complementarity problems (Q2790881) (← links)
- An accelerated Newton method of high-order convergence for solving a class of weakly nonlinear complementarity problems (Q4632707) (← links)
- A new matrix splitting generalized iteration method for linear complementarity problems (Q6090289) (← links)