A new method for P_*() horizontal linear complementarity problem based on full Newton step

MaRDI QIDQ3381787zbMATH OpenFDO

Authors Xiaoyu Gong, Xue-Feng Ding, Xianjia Wang

Publication date 29 September 2021

zbMATH Keywords

full-Newton stephorizontal linear complementarityinterior-point algorithmpolynomial complexity

Mathematics Subject Classification ID

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

Recommendations

• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for \(P_\ast(\kappa)\)-horizontal linear complementarity problems
• A full-Newton step infeasible-interior-point algorithm for P*()-horizontal linear complementarity problems
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
• A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems
• A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems

Cited in

(5)

• A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
• A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
• A full-Newton step infeasible-interior-point algorithm for P*()-horizontal linear complementarity problems
• A new search direction for full-Newton step interior-point method in P_*()-HLCP

This page was built for publication: A new method for \({P_*}(\kappa)\) horizontal linear complementarity problem based on full Newton step

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