On the convergence properties of Hildreth's quadratic programming algorithm (Q749443)

From MaRDI portal
Revision as of 04:55, 5 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the convergence properties of Hildreth's quadratic programming algorithm
scientific article

    Statements

    On the convergence properties of Hildreth's quadratic programming algorithm (English)
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references