On the convergence properties of Hildreth's quadratic programming algorithm (Q749443)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4172745
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the convergence properties of Hildreth's quadratic programming algorithm |
scientific article; zbMATH DE number 4172745 |
Statements
On the convergence properties of Hildreth's quadratic programming algorithm (English)
0 references
1990
0 references
The linear convergence rate of Hildreth's algorithm with an almost cyclic control for convex quadratic programming problems is proved. The proof is carried out for both its sequential and simultaneous version. Bounds on the convergence rate are derived. The results are compared with those obtained previously by \textit{J. Mandel} [Math. Program. 30, 218-228 (1984; Zbl 0545.90068)].
0 references
almost cyclic relaxation
0 references
linear convergence rate
0 references
Hildreth's algorithm
0 references
cyclic control
0 references
0.810790479183197
0 references
0.7721846699714661
0 references
