A quadratic programming algorithm

descriptionPublicationkeyboard_double_arrow_right Article , Other literature type 01 Sep 1988 English Publisher:Springer Science and Business Media LLCJournal:Zeitschrift für Operations Research, volume 32, pages 271-297 (issn: 0340-9422, eissn: 1432-5217,

Copyright policy )

Authors: Michael J. Best; Klaus Ritter 0002;

doi: 10.1007/bf01920297

A quadratic programming algorithm

- Summary
- Subjects
- Metrics

Abstract

Summary: By using conjugate directions a method for solving convex quadratic programming problems is developed. The algorithm generates a sequence of feasible solutions and terminates after a finite number of iterations. Extensions of the algorithm for nonconvex and large structured quadratic programming problems are discussed.

Related Organizations

Institut für Angewandte Statistik
Germany
University of Waterloo
Canada
TECHNISCHE UNIVERSITAET MUENCHEN
Germany
Technical University of Munich
Germany

Keywords

Methods of successive quadratic programming type, Decomposition methods, Convex programming, convex quadratic programming, decomposition, Numerical mathematical programming methods, sequence of feasible solutions, conjugate directions, Quadratic programming

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	8
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average