New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP

DOI10.1007/s11590-014-0800-4zbMath1331.90085MaRDI QIDQ497434

Yong-Cai Geng, Sumit K. Garg

Publication date: 24 September 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0800-4

zbMATH Keywords

linear complementarity problem; interior-point methods; polynomial complexity; full-Newton step; \(P_\ast(\kappa)\)-matrix

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

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

90C51: Interior-point methods