ISSN:
1573-2878
Keywords:
Algorithms
;
algorithmic equivalence
;
quadratic programming
;
least-distance problem
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
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-Whinstonsymmetric 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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00933376