Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

An equivalence between two algorithms for general quadratic programming

An equivalence between two algorithms for general quadratic programming In this paper, we demonstrate that the general quadratic programming algorithms of Fletcher, and Keller 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 Best. Several computational results have verified this equivalence. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

An equivalence between two algorithms for general quadratic programming

Acta Mathematicae Applicatae Sinica , Volume 3 (1) – Aug 6, 2005

Loading next page...
 
/lp/springer-journals/an-equivalence-between-two-algorithms-for-general-quadratic-mlMGeXUeai
Publisher
Springer Journals
Copyright
Copyright © 1987 by Science Press, Beijing, China and Allerton Press, Inc. New York, U.S.A.
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/BF02112643
Publisher site
See Article on Publisher Site

Abstract

In this paper, we demonstrate that the general quadratic programming algorithms of Fletcher, and Keller 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 Best. Several computational results have verified this equivalence.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Aug 6, 2005

References