Geodesic
Comparative study of two fast algorithms for projecting a~point to the standard simplex
Diskretnyj analiz i issledovanie operacij, Tome 23 (2016) no. 2, pp. 100-123

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider two algorithms for orthogonal projection of a point to the standard simplex. Although these algorithms are fundamentally different, the following fact unites them. When one of them has the maximum run time, the run time of the other is minimal. Some particular domains are presented whose points are projected by the considered algorithms in the minimum and maximum number of iterations. The correctness of the conclusions is confirmed by the numerical experiments independently implemented in the MatLab environment and the Java programming language. Ill. 11, bibliogr. 23.
Keywords: quadratic programming, projecting a point to a simplex, optimality conditions. 
@article{DA_2016_23_2_a5,
     author = {G. Sh. Tamasyan and E. V. Prosolupov and T. A. Angelov},
     title = {Comparative study of two fast algorithms for projecting a~point to the standard simplex},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {100--123},
     publisher = {mathdoc},
     volume = {23},
     number = {2},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2016_23_2_a5/}
}
TY  - JOUR
AU  - G. Sh. Tamasyan
AU  - E. V. Prosolupov
AU  - T. A. Angelov
TI  - Comparative study of two fast algorithms for projecting a~point to the standard simplex
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2016
SP  - 100
EP  - 123
VL  - 23
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2016_23_2_a5/
LA  - ru
ID  - DA_2016_23_2_a5
ER  - 
%0 Journal Article
%A G. Sh. Tamasyan
%A E. V. Prosolupov
%A T. A. Angelov
%T Comparative study of two fast algorithms for projecting a~point to the standard simplex
%J Diskretnyj analiz i issledovanie operacij
%D 2016
%P 100-123
%V 23
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2016_23_2_a5/
%G ru
%F DA_2016_23_2_a5
G. Sh. Tamasyan; E. V. Prosolupov; T. A. Angelov. Comparative study of two fast algorithms for projecting a~point to the standard simplex. Diskretnyj analiz i issledovanie operacij, Tome 23 (2016) no. 2, pp. 100-123. http://geodesic.mathdoc.fr/item/DA_2016_23_2_a5/