AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM
DOI10.15807/JORSJ.33.66zbMATH Open0715.90091OpenAlexW357029043MaRDI QIDQ3202145FDOQ3202145
Authors: 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
Recommendations
- A polynomial-time algorithm for a class of linear complementarity problems
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- An Infeasible-Interior-Point Method for Linear Complementarity Problems
- An interior point potential reduction algorithm for the linear complementarity problem
- A new polynomial time method for a linear complementarity problem
interior point methodlinear complementaritypositive semi-definite matrixpolynomially bounded algorithminterior path following algorithm
Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (13)
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- Title not available (Why is that?)
- Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming
- A long-step barrier method for convex quadratic programming
- Primal-dual target-following algorithms for linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- A finite improvement algorithm for the linear complementarity problem
- 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
- Strongly polynomial algorithm for a class of combinatorial LCPs
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3202145)
