A finite algorithm for finding the projection of a point onto the canonical simplex of ∝n
暂无分享,去创建一个
[1] J. B. Rosen. The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints , 1960 .
[2] Anthony V. Fiacco,et al. Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .
[3] G. Golub,et al. Linear least squares and quadratic programming , 1969 .
[4] P. Wolfe. Algorithm for a least-distance programming problem , 1974 .
[5] Philip Wolfe,et al. Finding the nearest point in A polytope , 1976, Math. Program..
[6] R. Rardin,et al. An algorithm for finding the shortest element of a polyhedral set with application to lagrangian duality , 1978 .
[7] Robert Mifflin,et al. A stable method for solving certain constrained least squares problems , 1979, Math. Program..