A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity

DOI10.1137/S1052623494267826zbMath0878.90094MaRDI QIDQ4340802

Rongqin Sheng, Florian A. Potra

Publication date: 12 June 1997

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

linear complementarity problemssuperlinear convergencepolynomialityinfeasible-interior-point algorithminfeasible starting pointspredictor--corrector

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (6)

An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity ⋮ Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points ⋮ Infeasible predictor-corrector interior-point method applied to image restoration in the presence of noise ⋮ An inexact interior point method for monotone NCP ⋮ Global convergence enhancement of classical linesearch interior point methods for MCPs ⋮ On the equivalence of linear complementarity problems

This page was built for publication: A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity