Pages that link to "Item:Q4161117"
From MaRDI portal
The following pages link to Computational complexity of complementary pivot methods (Q4161117):
Displayed 32 items.
- Some LCPs solvable in strongly polynomial time with Lemke's algorithm (Q344960) (← links)
- Multi-tier binary solution method for multi-product newsvendor problem with multiple constraints (Q439517) (← links)
- Open questions in complexity theory for numerical optimization (Q687097) (← links)
- Systems of linear interval equations (Q749156) (← links)
- CP-rays in simplicial cones (Q811413) (← links)
- Exponential lower bounds for finding Brouwer fixed points (Q911230) (← links)
- On the gradient-projection method for solving the nonsymmetric linear complementarity problem (Q1053618) (← links)
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem (Q1068731) (← links)
- NP-completeness of the linear complementarity problem (Q1095806) (← links)
- A polynomial-time algorithm for a class of linear complementarity problems (Q1123139) (← links)
- Observations on a class of nasty linear complementarity problems (Q1141086) (← links)
- A mixed formulation for frictional contact problems prone to Newton like solution methods (Q1191985) (← links)
- A short proof of finiteness of Murty's principal pivoting algorithm (Q1262225) (← links)
- A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point (Q1322558) (← links)
- On extremal behaviors of Murty's least index method (Q1332313) (← links)
- A finite improvement algorithm for the linear complementarity problem (Q1823161) (← links)
- 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 (Q2175368) (← links)
- Unique end of potential line (Q2194856) (← links)
- Pivoting in linear complementarity: Two polynomial-time cases (Q2391195) (← links)
- On the average number of steps of the simplex method of linear programming (Q3040925) (← links)
- Computational complexity of a piecewise linear homotopy algorithm (Q3321342) (← links)
- Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's (Q3657800) (← links)
- Affirmative action algorithms (Q3725860) (← links)
- Iterative algorithms for the linear complementarity problem (Q3800997) (← links)
- Computational complexity of LCPs associated with positive definite symmetric matrices (Q3854941) (← links)
- Computational experience with the Chow—Yorke algorithm (Q3877429) (← links)
- Computational complexity of parametric linear programming (Q3887263) (← links)
- An algorithm for the linear complementarity problem (Q4184202) (← links)
- On the average speed of Lemke's algorithm for quadratic programming (Q4721868) (← links)
- On the expected number of linear complementarity cones intersected by random and semi-random rays (Q4721878) (← links)
- On the computational complexity of piecewise-linear homotopy algorithms (Q4749612) (← links)
- Unique End of Potential Line (Q5091211) (← links)