COMPUTATIONAL-COMPLEXITY OF VANDERHEYDEN VARIABLE DIMENSION ALGORITHM AND DANTZIG-COTTLE PRINCIPAL PIVOTING METHOD FOR SOLVING LCPS

被引：7

作者：

BIRGE, JR

GANA, A

机构：

来源：

关键词：

D O I：

10.1007/BF02591869

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：316 / 325

页数：10

共 9 条

[1] Cottle R.W., 1968, LINEAR ALGEBRA APPL, V1, P103, DOI DOI 10.1016/0024-3795(68)90052-9
[2] Cottle R. W., 1968, MATH DECISION SCI 1, P144
[3] COMPLETELY-Q MATRICES
COTTLE, RW
[J]. MATHEMATICAL PROGRAMMING, 1980, 19 (03) : 347 - 351
[4] FATHI Y, 1979, THESIS U MICHIGAN AN
[5] BIMATRIX EQUILIBRIUM POINTS AND MATHEMATICAL-PROGRAMMING
LEMKE, CE
[J]. MANAGEMENT SCIENCE, 1965, 11 (07) : 681 - 689
[6] Murty K. G., 1974, Opsearch, V11, P123
[7] MURTY KG, 1978, MATH PROGRAM STUD, V7, P61, DOI 10.1007/BFb0120782
[8] ON THE COMPUTATIONAL-COMPLEXITY OF PIECEWISE-LINEAR HOMOTOPY ALGORITHMS
TODD, MJ
[J]. MATHEMATICAL PROGRAMMING, 1982, 24 (02) : 216 - 224
[9] A VARIABLE DIMENSION ALGORITHM FOR THE LINEAR COMPLEMENTARITY-PROBLEM
VANDERHEYDEN, L
[J]. MATHEMATICAL PROGRAMMING, 1980, 19 (03) : 328 - 346