Least-Index Resolution and Degeneracy in Linear Complementarity Problems with Sufficient Matrices

Abstract

This paper deals with the Principal Pivoting Method (PPM) for the Linear Complementarity Problem (LCP). It is shown that when the matrix M of the LCP (q,M) is (row and column) sufficient, the incorporation of a least-index pivot section selection rule in the PPM makes it a finite algorithm even when the LCP is degenerate. Keywords: Least-index rules; Mathematical models; Selection rules(physics).

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1990
Accession Number
ADA225055

Entities

People

  • Richard Cottle
  • Yow-yieh Chang

Organizations

  • Stanford University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • California
  • Equations
  • Governments
  • Iterations
  • Mathematics
  • Mechanics
  • Military Research
  • Numbers
  • Operations Research
  • Optimization
  • Real Numbers
  • Sequences
  • United States
  • United States Government

Readers

  • Computer Networking
  • Linear Algebra
  • Systems Analysis and Design