| Home > Publications database > Quadratic programming by successive overrelaxation |
| Book/Report | FZJ-2017-08668 |
1974
Kernforschungsanlage Jülich GmbH, Zentralbiliothek, Verlag
Jülich
Please use a persistent id in citations: http://hdl.handle.net/2128/16316
Report No.: Juel-1064-MA
Abstract: The idea of solving the definite linear complementarity problem by successive overrelaxation was originally proposed by Cryer. Hildreth and d'Esopo presented a Gauss-Seidel-like iterative method to solve a quadratic programming prob lern. In this paper a detailed discussion of Cryer's method applied to quadratic programming problems is given. The convergence behaviour is treated without assumptions on solvability of the problem. Numerical examples indicate the efficiency of the method.
|
The record appears in these collections: |