论文信息 - A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$

A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$

We present a O (η) time algorithm for the projection of a vector on the intersection of a hyperplane and R n + . A linear-time median-finding algorithm is used to determine the median of the components of the vector to be projected. This extends a previous result of Maculan and Paula Jr. concerning the projection on the η-dimensional simplex.

Michel Minoux | Nelson Maculan | Gérard Plateau

[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[2] C. Michelot. A finite algorithm for finding the projection of a point onto the canonical simplex of ∝n , 1986 .

[3] Geraldo Galdino de Paula,et al. A linear-time median-finding algorithm for projecting a vector on the simplex of Rn , 1989 .