A modified potential reduction algorithm for linear complementarity problems
From MaRDI portal
Publication:3429010
zbMATH Open1170.90499MaRDI QIDQ3429010FDOQ3429010
Authors: Xue Wang, Chongchao Huang, Qin-Xi Bai
Publication date: 30 March 2007
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
Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (9)
- A potential-reduction algorithm for linear complementarity problems
- A self-adjusting interior point algorithm for linear complementarity problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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)