The Linear Complementarity Problem on Oriented Matroids

Research output: Contribution to journalArticlepeer-review

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 Jan 1
Externally publishedYes

Keywords

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

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'The Linear Complementarity Problem on Oriented Matroids'. Together they form a unique fingerprint.

Cite this