A wide-neighborhood path-following algorithm for P^*()-matrix linear complementary problems

MaRDI QIDQ3171197zbMATH OpenFDO

Authors Li Zhang, Tao Zhang

Publication date 29 September 2011

zbMATH Keywords

complexitylinear complementary problems\(P^*(\tau)\)-matrixwide-neighborhood path-following algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• scientific article; zbMATH DE number 1300324
• A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem
• A high-order wide neighborhood interior-point algorithm for solving \(P_*(\tau)\) matrix linear complementarity problem
• A wide-neighborhood path-following algorithms for a class of nonmonotonic linear complementary problems and its computational complexity
• scientific article; zbMATH DE number 5138975

Cited in

(5)

• On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems
• scientific article; zbMATH DE number 5138975 (Why is no real title available?)
• New algorithm for \(P_*(k)\)-matrix linear complementarity problem based on algebraic transformation
• An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
• A high-order wide neighborhood interior-point algorithm for solving \(P_*(\tau)\) matrix linear complementarity problem

This page was built for publication: A wide-neighborhood path-following algorithm for \(P^*(\tau)\)-matrix linear complementary problems

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