scientific article; zbMATH DE number 1506063

MaRDI QIDQ4504558zbMATH OpenFDO

Authors Xu Meng, Xinxin Hu, Zhenghai Huang

Publication date 13 September 2000

zbMATH Keywords

algorithmsconvergenceinfeasible interior point algorithmmonotone horizontal linear complementarity problempolynomial time complexity

Mathematics Subject Classification ID

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

Recommendations

• Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity
• A combined homotopy interior point method for the linear complementarity problem
• An interior-point algorithm for horizontal linear complementarity problems
• Complementarity problems
• An infeasible-interior-point algorithm for linear complementarity problems

Cited in

(3)

• An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path
• scientific article; zbMATH DE number 3918118 (Why is no real title available?)
• Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems

This page was built for publication:

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