Direct algorithms for complementarity problems
Loading...
Authors
Kostreva, Michael M.
Issue Date
1976-08
Type
Electronic thesis
Thesis
Thesis
Language
ENG
Keywords
Mathematics
Alternative Title
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
School of Science
Full Citation
Publisher
Rensselaer Polytechnic Institute, Troy, NY