A wide-neighborhood path-following algorithms for a class of nonmonotonic linear complementary problems and its computational complexity

MaRDI QIDQ3501237zbMATH OpenFDO

Authors Li Zhang, Junling Wang

Publication date 3 June 2008

zbMATH Keywords

computational complexity\(P\)-matrixnonmonotonic linear complementary problemwide-neighborhood path-following method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• scientific article; zbMATH DE number 5138975
• Modifications of a wide-neighborhood path-following algorithm for a class of nonmonotonic linear complementary problems
• scientific article; zbMATH DE number 2016712
• Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity
• A wide-neighborhood infeasible-interior-point algorithms for uniform P-function nonlinear complementary problems and its computational complexity

Cited in

(12)

• The global linear convergence of a noninterior path-following algorithm for linear complementarity problems
• scientific article; zbMATH DE number 2016712 (Why is no real title available?)
• Complexity of a noninterior path-following method for the linear complementarity problem
• Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity
• 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?)
• A wide-neighborhood infeasible-interior-point algorithms for uniform P-function nonlinear complementary problems and its computational complexity
• Modifications of a wide-neighborhood path-following algorithm for a class of nonmonotonic linear complementary problems
• An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
• An Infeasible Path-Following Method for Monotone Complementarity Problems
• A wide-neighborhood path-following algorithm for \(P^*(\tau)\)-matrix linear complementary problems
• On superlinear and \(O(\sqrt{n}L)\) convergence of a path-following algorithm for monotone linear complementarity problems in a wide neighborhood

This page was built for publication: A wide-neighborhood path-following algorithms for a class of nonmonotonic linear complementary problems and its computational complexity

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