Path-following algorithms for monotone weighted complementarity problems

DOI10.16366/J.CNKI.1000-2367.2018.04.019MaRDI QIDQ4624418zbMATH OpenFDO

Authors Ping Han, Changhe Liu, Youlin Shang

Publication date 22 February 2019

Full work available at URL https://doi.org/10.16366/J.CNKI.1000-2367.2018.04.019

zbMATH Keywords

central pathmonotone weighted complementarity problemspath-following algorithmpolynomial complexitywide neighborhood

Mathematics Subject Classification ID

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

Recommendations

• Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem
• A weighted-path-following method for monotone horizontal linear complementarity problem
• A weighted-path-following method for symmetric cone linear complementarity problems
• A weighted-path-following method for the linear complementarity problem
• An implementing weighted path-following algorithm for linear complementarity problems

Cited in

(8)

• An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
• A weighted-path-following method for monotone horizontal linear complementarity problem
• An implementing weighted path-following algorithm for linear complementarity problems
• Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem
• An Infeasible Path-Following Method for Monotone Complementarity Problems
• A weighted-path-following method for symmetric cone linear complementarity problems
• A weighted-path-following method for the linear complementarity problem
• Path-following interior-point algorithm for monotone linear complementarity problems

This page was built for publication: Path-following algorithms for monotone weighted complementarity problems

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