More Results on the Convergence of Iterative Methods for the Symmetric Linear Complementarity Problem.

Abstract

In an earlier paper, the author has given some necessary and sufficient conditions for the convergence of iteractive methods for solving the linear complementarity problem. These conditions may be viewed as global in the sense that apply to the methods regardless of the constant vector in the linear complementarity problem. More precisely, the conditions characterize a certain class of matrices for which the iteractive methods will converge, in a certain vectors. In this paper, we improve on our previous results and establish necessary and sufficient conditions for the convergence of iteractive methods for solving each individual linear complementarity problem with a fixed constant vector. Unlike the earlier paper, our present analysis applies only to the symmetric linear complementarity problem. Various applications to a strictly convex quadratic program are also given. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1983
Accession Number
ADA132863

Entities

People

  • Jong-shi Pang

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Contracts
  • Convergence
  • Evolutionary Algorithms
  • Heuristic Methods
  • Inequalities
  • Lagrangian Functions
  • Mathematics
  • North Carolina
  • Optimization
  • Quadratic Programming
  • Sequences
  • Splitting
  • United States
  • Universities
  • Wisconsin

Fields of Study

  • Mathematics

Readers

  • Linear Algebra