An O(n) Algorithm for Projecting a Vector on the Intersection of a Hyperplane and a Box in Rn
暂无分享,去创建一个
[1] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..
[2] J. Kennington,et al. An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems , 1977 .
[3] P. Brucker. Review of recent development: An O( n) algorithm for quadratic knapsack problems , 1984 .
[4] C. Michelot. A finite algorithm for finding the projection of a point onto the canonical simplex of ∝n , 1986 .
[5] Geraldo Galdino de Paula,et al. A linear-time median-finding algorithm for projecting a vector on the simplex of Rn , 1989 .
[6] Panos M. Pardalos,et al. An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds , 1990, Math. Program..
[7] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[8] Michel Minoux,et al. A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$ , 1997 .