On the convergence properties of Hildreth’s quadratic programming algorithm

On the convergence properties of Hildreth’s quadratic programming algorithm

0.00 Avg rating0 Votes
Article ID: iaor1991728
Country: Netherlands
Volume: 47
Issue: 1
Start Page Number: 37
End Page Number: 51
Publication Date: May 1990
Journal: Mathematical Programming (Series A)
Authors:
Abstract:

The authors prove the linear convergence rate of Hildreth’s method for quadratic programming, in both its sequential and simultaneous versions. They give bounds on the asymptotic error constant and compare these bounds to those given by Mandel for the cyclic relaxation method for solving linear inequalities.

Reviews

Required fields are marked *. Your email address will not be published.