AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM

DOI10.15807/jorsj.33.66zbMath0715.90091OpenAlexW357029043MaRDI QIDQ3202145

Shinji Mizuno

Publication date: 1990

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.33.66

zbMATH Keywords

linear complementarityinterior point methodpositive semi-definite matrixpolynomially bounded algorithminterior path following algorithm

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (7)

Theoretical convergence of large-step primal-dual interior point algorithms for linear programming ⋮ Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence ⋮ An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence ⋮ Primal-dual target-following algorithms for linear programming ⋮ An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem ⋮ A long-step barrier method for convex quadratic programming ⋮ O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming

This page was built for publication: AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM