Convergence analysis of an infeasible interior point algorithm based on a regularized central path for linear complementarity problems

DOI10.1023/B:COAP.0000013059.84424.AFzbMath1046.90045MaRDI QIDQ1430273

Gongyun Zhao, Guanglu Zhou, Kim-Chuan Toh

Publication date: 27 May 2004

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

zbMATH Keywords

global convergencelinear complementarity problempolynomialityinfeasible interior point methodinfeasible regularized central path

Mathematics Subject Classification ID

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

Related Items (2)

A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function ⋮ An interior point-proximal method of multipliers for convex quadratic programming

This page was built for publication: Convergence analysis of an infeasible interior point algorithm based on a regularized central path for linear complementarity problems