Extensions of Lemke's algorithm for the linear complementarity problem
From MaRDI portal
Publication:1226441
DOI10.1007/BF00933128zbMath0327.90018OpenAlexW2020516503MaRDI QIDQ1226441
Publication date: 1976
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00933128
Related Items (35)
Parametric fixed point algorithms with applications to economic policy analysis ⋮ An extension of Karmarkar's algorithm for linear programming using dual variables ⋮ Some hybrid fixed point theorems related to optimization ⋮ Complexity of fixed points. I ⋮ A better triangulation for Wright's \(2^n\)-ray algorithm ⋮ Can we approximate zeros of functions with nonzero topological degree? ⋮ A nonlinear integral equation from the Ball-Zachariasen model of diffractive scattering: numerical solution near a singularity of the Fréchet derivative ⋮ Exchange market equilibria with Leontief's utility: freedom of pricing leads to rationality ⋮ Karmarkar's projective method for linear programming: a computational survey ⋮ A note on computing equilibria in economies with activity analysis models of production ⋮ A property of matrices with positive determinants ⋮ A constructive proof of Tucker's combinatorial lemma ⋮ Solving discrete systems of nonlinear equations ⋮ Simplicial approximation of unemployment equilibria ⋮ Complementary pivoting and the Hopf degree theorem ⋮ A triangulation of the n-cube ⋮ On the existence of rational expectations equilibrium ⋮ A method for approximating the solution set of a system of convex inequalities by polytopes ⋮ Simplicial pivoting for mesh generation of implicitly defined surfaces ⋮ Volume integrals for boundary element methods ⋮ Algorithms for finding connected separators between antipodal points ⋮ Constructive proofs of fixed point theorems for set valued operators by simplicial algorithms ⋮ A triangulation of the 6-cube with 308 simplices ⋮ Robust stability: Perturbed systems with perturbed equilibria ⋮ Lower bounds for the simplexity of the \(n\)-cube ⋮ A stability concept for matrix game optimal strategies and its application to linear programming sensitivity analysis ⋮ Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models ⋮ Lower bounds on the worst-case complexity of some oracle algorithms ⋮ A discrete multivariate mean value theorem with applications ⋮ Simplexity of the cube ⋮ The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix ⋮ An approximate algorithm for computing multidimensional convex hulls ⋮ Simplicial algorithms for computing stationary probabilities of stochastic matrices ⋮ A polytopal generalization of Sperner's lemma ⋮ Properties of the transfer functions of compartmental models. II
Cites Work
This page was built for publication: Extensions of Lemke's algorithm for the linear complementarity problem
