講演抄録/キーワード |
講演名 |
2013-12-20 14:25
The Hidden K-matrix Linear Complementarity Problem is at Least as Hard as Linear Programming over Cubes ○Jan Foniok(Univ. of Warwick)・Komei Fukuda(ETH Zurich)・Lorenz Klaus(NII/JST) COMP2013-45 |
抄録 |
(和) |
The linear complementarity problem (LCP) is a framework that unifies optimization problems, such as linear programming, convex quadratic programming, bimatrix games and graph games. The study of the LCP and its solving methods is usually done by employing combinatorial models. We define analogues of hidden Z and hidden K-matrices in the setting of oriented matroids and show that LCPs with hidden K-matrices and linear programs over combinatorial cubes have the same problem structure. |
(英) |
The linear complementarity problem (LCP) is a framework that unifies optimization problems, such as linear programming, convex quadratic programming, bimatrix games and graph games. The study of the LCP and its solving methods is usually done by employing combinatorial models. We define analogues of hidden Z and hidden K-matrices in the setting of oriented matroids and show that LCPs with hidden K-matrices and linear programs over combinatorial cubes have the same problem structure. |
キーワード |
(和) |
Linear complementarity / Oriented matroids / Pivoting / Simplex / Unique-sink orientation / P-matrix / Hidden Z / Hidden K |
(英) |
Linear complementarity / Oriented matroids / Pivoting / Simplex / Unique-sink orientation / P-matrix / Hidden Z / Hidden K |
文献情報 |
信学技報, vol. 113, no. 371, COMP2013-45, pp. 45-52, 2013年12月. |
資料番号 |
COMP2013-45 |
発行日 |
2013-12-13 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
PDFダウンロード |
COMP2013-45 |