Pages that link to "Item:Q1226441"

The following pages link to Extensions of Lemke's algorithm for the linear complementarity problem (Q1226441):

Displaying 33 items.

• A nonlinear integral equation from the Ball-Zachariasen model of diffractive scattering: numerical solution near a singularity of the Fréchet derivative (Q600239) (← links)
• Solving discrete systems of nonlinear equations (Q635151) (← links)
• A triangulation of the 6-cube with 308 simplices (Q686174) (← links)
• Robust stability: Perturbed systems with perturbed equilibria (Q687840) (← links)
• The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix (Q781116) (← links)
• Exchange market equilibria with Leontief's utility: freedom of pricing leads to rationality (Q883994) (← links)
• A discrete multivariate mean value theorem with applications (Q1011164) (← links)
• Properties of the transfer functions of compartmental models. II (Q1071668) (← links)
• Parametric fixed point algorithms with applications to economic policy analysis (Q1085770) (← links)
• An extension of Karmarkar's algorithm for linear programming using dual variables (Q1090601) (← links)
• Some hybrid fixed point theorems related to optimization (Q1094659) (← links)
• Complexity of fixed points. I (Q1101185) (← links)
• Can we approximate zeros of functions with nonzero topological degree? (Q1119338) (← links)
• A note on computing equilibria in economies with activity analysis models of production (Q1138982) (← links)
• A property of matrices with positive determinants (Q1140690) (← links)
• A constructive proof of Tucker's combinatorial lemma (Q1153158) (← links)
• Simplicial approximation of unemployment equilibria (Q1158083) (← links)
• Complementary pivoting and the Hopf degree theorem (Q1162286) (← links)
• A triangulation of the n-cube (Q1163234) (← links)
• On the existence of rational expectations equilibrium (Q1164538) (← links)
• A method for approximating the solution set of a system of convex inequalities by polytopes (Q1182665) (← links)
• Simplicial pivoting for mesh generation of implicitly defined surfaces (Q1183523) (← links)
• Volume integrals for boundary element methods (Q1184105) (← links)
• Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models (Q1207805) (← links)
• Lower bounds on the worst-case complexity of some oracle algorithms (Q1251896) (← links)
• An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
• Simplicial algorithms for computing stationary probabilities of stochastic matrices (Q1294413) (← links)
• A better triangulation for Wright's \(2^n\)-ray algorithm (Q1365094) (← links)
• Lower bounds for the simplexity of the \(n\)-cube (Q1759408) (← links)
• Simplexity of the cube (Q1815315) (← links)
• A polytopal generalization of Sperner's lemma (Q1865380) (← links)
• Algorithms for finding connected separators between antipodal points (Q2463880) (← links)
• A stability concept for matrix game optimal strategies and its application to linear programming sensitivity analysis (Q3028753) (← links)