论文信息 - A variable dimension algorithm for the linear complementarity problem

A variable dimension algorithm for the linear complementarity problem

A variable dimension algorithm is presented for the linear complementarity problems − Mz = q; s,z ≥ 0; sizi = 0 fori = 1,2, ⋯ ,n. The algorithm solves a sequence of subproblems of different dimensions, the sequence being possibly nonmonotonic in the dimension of the subproblem solved. Every subproblem is the linear complementarity problem defined by a leading principal minor of the matrixM. Index-theoretic arguments characterize the points at which nonmonotonic behavior occurs.

Ludo van der Heyden | L. V. D. Heyden

[1] Richard W. Cottle. Completely- matrices , 1980, Math. Program..

[2] L. Shapley. On Balanced Games Without Side Payments , 1973 .

[3] Herbert E. Scarf,et al. The Computation of Economic Equilibria , 1974 .

[4] C. E. Lemke. Some pivot schemes for the linear complementarity problem , 1978 .

[5] B. Eaves. The Linear Complementarity Problem , 1971 .

[6] Ludo Van Der Heyden. Refinement methods for computing fixed points using primitive sets. , 1979 .

[7] C. E. Lemke,et al. Bimatrix Equilibrium Points and Mathematical Programming , 1965 .

[8] Herbert E. Scarf,et al. The Solution of Systems of Piecewise Linear Equations , 1976, Math. Oper. Res..

[9] Layne T. Watson,et al. Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem , 1978, Math. Oper. Res..

[10] C. E. Lemke,et al. Equilibrium Points of Bimatrix Games , 1964 .

[11] Stephen J. Grotzinger,et al. On generalizing shapley's index theory to labelled pseudomanifolds , 1976, Math. Program..

[12] George B. Dantzig,et al. Linear programming and extensions , 1965 .

[13] G. Dantzig,et al. COMPLEMENTARY PIVOT THEORY OF MATHEMATICAL PROGRAMMING , 1968 .

[14] L. Shapley. A note on the Lemke-Howson algorithm , 1974 .