Computational complexity of complementary pivot methods

Cited in

(33)

Open questions in complexity theory for numerical optimization
Computational experience with the Chow—Yorke algorithm
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
Systems of linear interval equations
Pivoting in linear complementarity: Two polynomial-time cases
Computational complexity of parametric linear programming
On the gradient-projection method for solving the nonsymmetric linear complementarity problem
On the average number of steps of the simplex method of linear programming
A polynomial-time algorithm for a class of linear complementarity problems
Unique End of Potential Line
A finite improvement algorithm for the linear complementarity problem
A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point
On the computational complexity of piecewise-linear homotopy algorithms
Unique end of potential line
Exponential lower bounds for finding Brouwer fixed points
Multi-tier binary solution method for multi-product newsvendor problem with multiple constraints
Some LCPs solvable in strongly polynomial time with Lemke's algorithm
A short proof of finiteness of Murty's principal pivoting algorithm
An algorithm for the linear complementarity problem
On extremal behaviors of Murty's least index method
Polyhedral Newton-min algorithms for complementarity problems
Computational complexity of a piecewise linear homotopy algorithm
CP-rays in simplicial cones
NP-completeness of the linear complementarity problem
Observations on a class of nasty linear complementarity problems
Computational complexity of LCPs associated with positive definite symmetric matrices
A mixed formulation for frictional contact problems prone to Newton like solution methods
Affirmative action algorithms
Iterative algorithms for the linear complementarity problem
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
Linear, quadratic, and bilinear programming approaches to 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

This page was built for publication: Computational complexity of complementary pivot methods

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