# Algorithmic equivalence in quadratic programming, I: A least-distance programming problem

Contributed Papers

- 100 Downloads
- 10 Citations

## Abstract

It is demonstrated that Wolfe's algorithm for finding the point of smallest Euclidean norm in a given convex polytope generates the same sequence of feasible points as does the van de Panne-Whinston*symmetric* algorithm applied to the associated quadratic programming problem. Furthermore, it is shown how the latter algorithm may be simplified for application to problems of this type.

## Key Words

Algorithms algorithmic equivalence quadratic programming least-distance problem## Preview

Unable to display preview. Download preview PDF.

## References

- 1.Wolfe, P.,
*Algorithm for a Least-Distance Programming Problem*, Mathematical Programming Study 1, Edited by M. L. Balinski, North-Holland Publishing Company, Amsterdam, The Netherlands, 1974.Google Scholar - 2.Wolfe, P.,
*Finding the Nearest Point in a Polytope*, IBM Research Center, Yorktown Heights, New York, Report No. RC-4887, 1974.Google Scholar - 3.Tucker, A. W.,
*A Least-Distance Approach to Quadratic Programming*, Mathematics of the Decision Sciences, Part 1, Edited by G. B. Dantzig and A. F. Veinott, Jr., American Mathematical Society, Providence, Rhode Island, 1968.Google Scholar - 4.Van De Panne, C., andWhinston, A.,
*The Symmetric Formulation of the Simplex Method for Quadratic Programming*, Econometrica, Vol. 37, pp. 507–527, 1969.Google Scholar - 5.Cottle, R. W., andDantzig, G. B.,
*Complementary Pivot Theory of Mathematical Programming*, Mathematics of the Decision Sciences, Part 1, Edited by G. B. Dantzig and A. F. Veinott, Jr., American Mathematical Society, Providence, Rhode Island, 1968.Google Scholar - 6.Parsons, T. D.
*A Combinatorial Approach to Convex Quadratic Programming*, Princeton University, PhD Thesis, 1966.Google Scholar - 7.Keller, E. L.,
*Quadratic Optimization and Linear Complementarity*, University of Michigan, PhD Thesis, 1969.Google Scholar - 8.Cottle, R. W.,
*The Principal Pivoting Method of Quadratic Programming*, Mathematics of the Decision Sciences, Part 1, Edited by G. B. Dantzig and A. F. Veinott, Jr., American Mathematical Society, Providence, Rhode Island, 1968.Google Scholar - 9.Zoutendijk, G.,
*Methods of Feasible Directions*, Elsevier Publishing Company, Amsterdam, The Netherlands, 1960.Google Scholar - 10.Wilhelmsen, D. R.,
*A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation*, Mathematics of Computation, Vol. 30, pp. 48–57, 1976.Google Scholar - 11.Cottle, R. W., andDjang, A.,
*Algorithmic Equivalence in Quadratic Programming I:r A Least-Distance Programming Problem*, Stanford University, Department of Operations Research, Report No. 76–26, 1976.Google Scholar - 12.Dantzig, G. B.,
*Linear Programming and Extensions*, Princeton University Press, Princeton, New Jersey, 1963.Google Scholar

## Copyright information

© Plenum Publishing Corporation 1979