Author:
Malozemov V. N.,Tamasyan G. Sh.
Subject
Computational Mathematics
Reference9 articles.
1. M. Held, P. Wolfe, and H. P. Crowder, “Validation of the subgradient optimization,” Math. Programming 6, 62–88 (1974).
2. N. Maculan and G. G. de Paula, Jr., “A linear-time median-finding algorithm for projecting a vector on the simplex of Rn,” Oper. Res. Lett. 8 (4), 219–222 (1989).
3. V. N. Malozemov and A. B. Pevnyi, “A fast algorithm for projecting a vector on a simplex,” Vestn. S.-Peterb. Univ., Ser. 1, No. 1, 112–113 (1992).
4. C. Michelot, “A finite algorithm for finding the projection of a point onto the canonical simplex of Rn,” J. Optim. Theory Appl. 50, 195–200 (1986).
5. A. Causa and F. Raciti, “A purely geometric approach to the problem of computing the projection of a point on a simplex,” J. Optim. Theory Appl. 156 (2), 524–528 (2013).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献