Fixed Point Methods for the Complementarity Problem.

Abstract

This paper is concerned with iterative procedures for the monotone complementarity problem. These iterative methods consist of findng fixed points of appropriate continuous maps. In the case of the linear complementarity problem, it is shown that the problem is solvable if and only if the sequence of iterates is bounded in which case summability methods are used to find a solution of the nonlinear complementarity problem satisfying certain regularity conditions for which the problem has a nonempty bounded solution set. Keywords: Monotone operators; Operators(mathematics). (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1985
Accession Number
ADA160976

Entities

People

  • P. K. Subramanian

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Science
  • Contracts
  • Convex Sets
  • Materials
  • Mathematical Programming
  • Mathematics
  • Military Research
  • North Carolina
  • Numbers
  • Optimization
  • Real Numbers
  • Sequences
  • Theorems
  • United States
  • Universities
  • Wisconsin

Fields of Study

  • Mathematics

Readers

  • Linear Algebra
  • Operations Research