Computational complexity of complementary pivot methods
From MaRDI portal
Publication:4161117
DOI10.1007/BFb0120782zbMath0381.90108OpenAlexW171323660MaRDI QIDQ4161117
Publication date: 1978
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0120782
Related Items
On extremal behaviors of Murty's least index method, NP-completeness of the linear complementarity problem, Affirmative action algorithms, Pivoting in linear complementarity: Two polynomial-time cases, Some LCPs solvable in strongly polynomial time with Lemke's algorithm, A polynomial-time 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, Observations on a class of nasty linear complementarity problems, Unique end of potential line, Multi-tier binary solution method for multi-product newsvendor problem with multiple constraints, Exponential lower bounds for finding Brouwer fixed points, Iterative algorithms for the linear complementarity problem, A mixed formulation for frictional contact problems prone to Newton like solution methods, Open questions in complexity theory for numerical optimization, Computational complexity of a piecewise linear homotopy algorithm, On the average number of steps of the simplex method of linear programming, Computational complexity of LCPs associated with positive definite symmetric matrices, Computational experience with the Chow—Yorke algorithm, Computational complexity of parametric linear programming, A short proof of finiteness of Murty's principal pivoting algorithm, An algorithm for the linear complementarity problem, Systems of linear interval equations, Unique End of Potential Line, On the average speed of Lemke's algorithm for quadratic programming, On the expected number of linear complementarity cones intersected by random and semi-random rays, A finite improvement algorithm for the linear complementarity problem, Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's, On the gradient-projection method for solving the nonsymmetric linear complementarity problem, On the computational complexity of piecewise-linear homotopy algorithms, Linear, quadratic, and bilinear programming approaches to the linear complementarity problem, CP-rays in simplicial cones, A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point
