A finite algorithm for finding the projection of a point onto the canonical simplex of ∝ⁿ

1. Rosen, J. B.,The Gradient Projection Method of Nonlinear Programming, Part 1, Linear Constraints, SIAM Journal on Applied Mathematics, Vol. 8, pp. 181–217, 1960.

   Google Scholar 

2. Rosen, J. B.,The Gradient Projection Method of Nonlinear Programming, Part 2, Nonlinear Constraints, SIAM Journal on Applied Mathematics, Vol. 9, pp. 414–432, 1961.

   Google Scholar 

3. Fiacco, A. V., andMcCormick, G. P.,Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley and Sons, New York, New York, 1968.

   Google Scholar 

4. Bazaraa, M. S., Goode, J. J., andRardin, R. L.,An Algorithm for Finding the Shortest Element of a Polyhedral Set with Application to Lagrangian Duality, Journal of Mathematical Analysis and Applications, Vol. 65, pp. 278–288, 1978.

   Google Scholar 

5. Golub, G. H., andSaunders, M. A.,Linear Least Squares and Quadratic Programming, Integer and Nonlinear Programming, Edited by J. Abadie, North-Holland, Amsterdam, Holland, 1970.

   Google Scholar 

6. Mifflin, R.,A Stable Method for Solving Certain Constrained Least Squares Problems, Mathematical Programming, Vol. 16, pp. 141–158, 1979.

   Google Scholar 

7. Wolfe, P.,Algorithm for a Least-Distance Programming Problem, Mathematical Programming Studies, Vol. 1, pp. 190–205, 1974.

   Google Scholar 

8. Wolfe, P.,Finding the Nearest Point in a Polytope, Mathematical Programming, Vol. 11, pp. 128–149, 1976.

   Google Scholar 

9. Rockafellar, R. T.,Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.

   Google Scholar 

Download references