A modified potential reduction algorithm for linear complementarity problems
From MaRDI portal
Publication:3429010
Recommendations
- An interior point potential reduction algorithm for the linear complementarity problem
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm
- An extension of interior point potential reduction algorithm to solve general lcps
- scientific article; zbMATH DE number 1326028
Cited in
(9)- A self-adjusting interior point algorithm for linear complementarity problems
- A potential-reduction algorithm for linear complementarity problems
- scientific article; zbMATH DE number 776080 (Why is no real title available?)
- scientific article; zbMATH DE number 1866915 (Why is no real title available?)
- A potential reduction method for the generalized linear complementarity problem over a polyhedral cone
- An extension of the potential reduction algorithm for linear complementarity problems with some priority goals
- scientific article; zbMATH DE number 724220 (Why is no real title available?)
- An interior point potential reduction algorithm for the linear complementarity problem
- Reducing horizontal linear complementarity problems
This page was built for publication: A modified potential reduction algorithm for linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3429010)