Complexity of a large-update interior-point algorithm for P_*() linear complementarity problem

zbMATH Open1224.90192MaRDI QIDQ3072097FDOQ3072097

Authors: Huaping Chen, Mingwang Zhang 

Publication date: 5 February 2011

Recommendations

• Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
• Large-update interior point algorithm for \(P_*\)-linear complementarity problem
• A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
• A large-update interior point algorithm for \(P_*(\kappa)\) LCP based on a new kernel function
• Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function

zbMATH Keywords

kernel functioninterior-point algorithmlarge-update method

Mathematics Subject Classification ID

Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cited In (1)

• Large-update interior point algorithm for \(P_*\)-linear complementarity problem

This page was built for publication: Complexity of a large-update interior-point algorithm for \(P_*(\kappa)\) linear complementarity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3072097)