Paper Abstract and Keywords |
Presentation |
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 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
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. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
Linear complementarity / Oriented matroids / Pivoting / Simplex / Unique-sink orientation / P-matrix / Hidden Z / Hidden K |
Reference Info. |
IEICE Tech. Rep., vol. 113, no. 371, COMP2013-45, pp. 45-52, Dec. 2013. |
Paper # |
COMP2013-45 |
Date of Issue |
2013-12-13 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
COMP2013-45 |
Conference Information |
Committee |
COMP |
Conference Date |
2013-12-20 - 2013-12-21 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Okinawa Industry Support Center |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2013-12-COMP |
Language |
English |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
The Hidden K-matrix Linear Complementarity Problem is at Least as Hard as Linear Programming over Cubes |
Sub Title (in English) |
|
Keyword(1) |
Linear complementarity |
Keyword(2) |
Oriented matroids |
Keyword(3) |
Pivoting |
Keyword(4) |
Simplex |
Keyword(5) |
Unique-sink orientation |
Keyword(6) |
P-matrix |
Keyword(7) |
Hidden Z |
Keyword(8) |
Hidden K |
1st Author's Name |
Jan Foniok |
1st Author's Affiliation |
University of Warwick (Univ. of Warwick) |
2nd Author's Name |
Komei Fukuda |
2nd Author's Affiliation |
ETH Zurich (ETH Zurich) |
3rd Author's Name |
Lorenz Klaus |
3rd Author's Affiliation |
NII/JST, ERATO, Kawarabayashi Large Graph Project (NII/JST) |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2013-12-20 14:25:00 |
Presentation Time |
25 minutes |
Registration for |
COMP |
Paper # |
COMP2013-45 |
Volume (vol) |
vol.113 |
Number (no) |
no.371 |
Page |
pp.45-52 |
#Pages |
8 |
Date of Issue |
2013-12-13 (COMP) |
|