Abstract
An O( n) time algorithm for the projection of a vector is presented on the simplex of R n . We use a linear-time median-finding algorithm to determine the median of the components of a vector. The problem of finding such a projection arises as a subproblem of some optimization methods.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
