The Linear Complementarity Problem on Oriented Matroids

Research output: Contribution to journalArticle

Abstract

The linear complementarity problem (LCP) is one of the most widely studied mathematical programming problems. The theory of LCP can be extended to oriented matroids which are combinatorial abstractions of linear subspaces of Euclidean spaces. This paper briefly surveys the LCP oriented matroids and algorithms for the LCP on oriented matroids.

Original languageEnglish
Pages (from-to)353-361
Number of pages9
JournalIEICE Transactions on Information and Systems
VolumeE83-D
Issue number3
Publication statusPublished - 2000
Externally publishedYes

Fingerprint

Mathematical programming

Keywords

  • Criss-cross algorithm
  • Linear complementarity problem
  • Oriented matroids

ASJC Scopus subject areas

  • Information Systems
  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

The Linear Complementarity Problem on Oriented Matroids. / Tamura, Akihisa.

In: IEICE Transactions on Information and Systems, Vol. E83-D, No. 3, 2000, p. 353-361.

Research output: Contribution to journalArticle

@article{5ee7fc45f07c417dbe9a4bd8e905a859,
title = "The Linear Complementarity Problem on Oriented Matroids",
abstract = "The linear complementarity problem (LCP) is one of the most widely studied mathematical programming problems. The theory of LCP can be extended to oriented matroids which are combinatorial abstractions of linear subspaces of Euclidean spaces. This paper briefly surveys the LCP oriented matroids and algorithms for the LCP on oriented matroids.",
keywords = "Criss-cross algorithm, Linear complementarity problem, Oriented matroids",
author = "Akihisa Tamura",
year = "2000",
language = "English",
volume = "E83-D",
pages = "353--361",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "3",

}

TY - JOUR

T1 - The Linear Complementarity Problem on Oriented Matroids

AU - Tamura, Akihisa

PY - 2000

Y1 - 2000

N2 - The linear complementarity problem (LCP) is one of the most widely studied mathematical programming problems. The theory of LCP can be extended to oriented matroids which are combinatorial abstractions of linear subspaces of Euclidean spaces. This paper briefly surveys the LCP oriented matroids and algorithms for the LCP on oriented matroids.

AB - The linear complementarity problem (LCP) is one of the most widely studied mathematical programming problems. The theory of LCP can be extended to oriented matroids which are combinatorial abstractions of linear subspaces of Euclidean spaces. This paper briefly surveys the LCP oriented matroids and algorithms for the LCP on oriented matroids.

KW - Criss-cross algorithm

KW - Linear complementarity problem

KW - Oriented matroids

UR - http://www.scopus.com/inward/record.url?scp=0034156581&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034156581&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0034156581

VL - E83-D

SP - 353

EP - 361

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 3

ER -