Direct algorithms for complementarity problems

Authors
Kostreva, Michael M.
ORCID
Loading...
Thumbnail Image
Other Contributors
Habetler, George Joseph
Lemke, Carlton E.
Rogers Edwin H.
Arden, Dean N.
Issue Date
1976-08
Keywords
Mathematics
Degree
PhD
Terms of Use
This electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.
Full Citation
Abstract
This thesis deals with three types of complementarity problems: linear complementarity problems, nonlinear complementarity problems and generalized nonlinear complementarity problems. The emphasis is on algorithms for solving complementarity problems using a "directll approach. In this direct approach a finite sequence of systems of equations are solved approximately. The final system of equations considered represents the complementarity condition at the solution The algorithms gain efficiency because: 1) intermediate systems of equations are of reduced dimensionality and 2) high accuracy solutions to intermediate systems are unnecessary.
Description
August 1976
School of Science
Department
Dept. of Mathematical Sciences
Publisher
Rensselaer Polytechnic Institute, Troy, NY
Relationships
Rensselaer Theses and Dissertations Online Collection
Access
Restricted to current Rensselaer faculty, staff and students. Access inquiries may be directed to the Rensselaer Libraries.