A polynomial interior-point algorithm for monotone linear complementarity problems

DOI10.1007/s10957-012-0195-2zbMath1267.90155MaRDI QIDQ353166

Mohammad Hasan, M. Dambrine

Publication date: 12 July 2013

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-012-0195-2

zbMATH Keywords

polynomial complexity; central path; feasible interior-point method; monotone linear complementarity problem (MLCP)

Mathematics Subject Classification ID

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

90C51: Interior-point methods