The following pages link to (Q4323620):
Displaying 10 items.
- Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix (Q715065) (← links)
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569) (← links)
- An interior point potential reduction algorithm for the linear complementarity problem (Q1196718) (← links)
- An extension of the potential reduction algorithm for linear complementarity problems with some priority goals (Q1318200) (← links)
- Error bounds in mathematical programming (Q1365060) (← links)
- Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems. (Q1807690) (← links)
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem (Q1906276) (← links)
- Pivoting in linear complementarity: Two polynomial-time cases (Q2391195) (← links)
- An asymptotical \(O((k+1)n^3L)\) affine scaling algorithm for the \(P_*(k)\)-matrix linear complementarity problem (Q2725284) (← links)
- A potential-reduction algorithm for linear complementarity problems (Q5697858) (← links)
