A path-following algorithm for solving linear complementarity problems based on algebraically equivalent transformations

MaRDI QIDQ5486903zbMATH OpenFDO

Authors Suyan He, Shaohua Pan, Xingsi Li, Hong-Wu Zhang

Publication date 15 September 2006

Mathematics Subject Classification ID

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

Recommendations

• New algorithm for P_*(k)-matrix linear complementarity problem based on algebraic transformation
• An infeasible interior point algorithm for P₀-LCP based on algebraic transformation
• An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
• Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
• Interior-point algorithms for uniform P-function nonlinear complementary problem based on algebraically equivalent path

Cited in

(4)

• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
• An infeasible interior point algorithm for P₀-LCP based on algebraic transformation
• Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation

This page was built for publication: A path-following algorithm for solving linear complementarity problems based on algebraically equivalent transformations

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