论文信息 - Algorithm for a least-distance programming problem

Algorithm for a least-distance programming problem

An algorithm is developed for the problem of finding the point of smallest Euclidean norm in the convex hull of a given finite point set in a Euclidean space, with particular attention paid to the description of the procedure in geometric terms.

P. Wolfe

[1] Philip Wolfe,et al. An algorithm for quadratic programming , 1956 .

[2] P. Wolfe. THE SIMPLEX METHOD FOR QUADRATIC PROGRAMMING , 1959 .

[3] George B. Dantzig,et al. Linear programming and extensions , 1965 .

[4] G. Dantzig,et al. Mathematics of the decision sciences , 1968 .

[5] George B. Dantzig,et al. MATHEMATICS OF THE DECISION SCIENCES, PART 2. LECTURES IN APPLIED MATHEMATICS. VOLUME 12, , 1968 .

[6] H. L. Le Roy,et al. Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability; Vol. IV , 1969 .

[7] T. D. Parsons,et al. Hybrid programs: Linear and least-distance , 1971, Math. Program..

[8] B. Eaves. On Quadratic Programming , 1971 .

[9] R. Fletcher. A General Quadratic Programming Algorithm , 1971 .

[10] H. Kuhn. Proceedings of the Princeton Symposium on Mathematical Programming , 1971 .

[11] Åke Björck,et al. Numerical Methods , 1995, Handbook of Marine Craft Hydrodynamics and Motion Control.