PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS

DOI10.15807/JORSJ.32.75MaRDI QIDQ3491306zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

polynomial time algorithmlinear complementarity

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A polynomial-time algorithm for a class of linear complementarity problems
• A Polynomial-Time Predictor-Corrector Algorithm for a Class of Linear Complementarity Problems
• scientific article; zbMATH DE number 95069
• A new polynomial time method for a linear complementarity problem
• An interior point potential reduction algorithm for the linear complementarity problem

Cited in

(14)

• The largest step path following algorithm for monotone linear complementarity problems
• A Finite Algorithm for Almost Linear Complementarity Problems
• Improved algorithms for linear complementarity problem arising from collision response
• A class of polynomially solvable linear complementarity problems
• scientific article; zbMATH DE number 4062853 (Why is no real title available?)
• A polynomial-time algorithm for a class of linear complementarity problems
• A globally convergent primal-dual interior point algorithm for convex programming
• A new polynomial time method for a linear complementarity problem
• Parameterized complexity of sparse linear complementarity problems
• Polyhedral Newton-min algorithms for complementarity problems
• An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
• Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
• A Polynomial-Time Predictor-Corrector Algorithm for a Class of 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

This page was built for publication: PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3491306)