PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS
From MaRDI portal
Publication:3491306
DOI10.15807/jorsj.32.75zbMath0708.90050OpenAlexW1576233016MaRDI QIDQ3491306
Shinji Mizuno, Akiko Yoshise, Takeshi Kikuchi
Publication date: 1989
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.32.75
Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A globally convergent primal-dual interior point algorithm for convex programming, Theoretical convergence of large-step primal-dual interior point algorithms for linear programming, The largest step path following algorithm for monotone linear complementarity problems, A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem, An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem, A new polynomial time method for a linear complementarity problem
