An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
From MaRDI portal
Publication:1181916
DOI10.1007/BF01582906zbMath0745.90070MaRDI QIDQ1181916
Michael J. Todd, Shinji Mizuno
Publication date: 27 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
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
Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems, On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A polynomial-time algorithm for a class of linear complementarity problems
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming
- A new polynomial time method for a linear complementarity problem
- Complementary pivot theory of mathematical programming
- AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM
- PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS
- Bimatrix Equilibrium Points and Mathematical Programming
