An equivalence between two algorithms for general quadratic programming
type: Item
instance of: scholarly article
title: An equivalence between two algorithms for general quadratic programming
zbMATH Open document ID: 0625.90066
DOI: 10.1007/BF02112643
author: Shucheng Liu
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 1987-01-01T00:00:00Z
review text: We demonstrate that the general quadratic programming algorithms of \textit{R. Fletcher} [J. Inst. Math. Appl. 7, 76-91 (1971; Zbl 0226.90036)] and \textit{E. L. Keller} [Math. Program. 5, 311-337 (1973; Zbl 0276.90044)] are equivalent in the sense that they generate identical sequences of points. Such an equivalence of the two algorithms extends earlier results for convex quadratic programming due to \textit{M. J. Best} [ibid. 30, 71-87 (1984; Zbl 0551.90074)]. Several computational results have verified this equivalence.
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 4016604
zbMATH Keywords: computational results
MaRDI profile type: Publication
cites work: Equivalence of some quadratic programming algorithms
cites work: A General Quadratic Programming Algorithm
cites work: The general quadratic optimization problem
cites work: Simplicial methods for quadratic programming
full work available at URL: https://doi.org/10.1007/bf02112643
OpenAlex ID: W2059609819
description: scientific article; zbMATH DE number 4016604