Comparative study of two fast algorithms for projecting a point to the standard simplex-Reference-Cited by-同舟云学术

Comparative study of two fast algorithms for projecting a point to the standard simplex

Published:2016-04 Issue:2 Volume:10 Page:288-301
ISSN:1990-4789
Container-title:Journal of Applied and Industrial Mathematics
language:en
Short-container-title:J. Appl. Ind. Math.

Author:

Tamasyan G. Sh.,Prosolupov E. V.,Angelov T. A.

Publisher

Pleiades Publishing Ltd

Subject

Applied Mathematics,Industrial and Manufacturing Engineering

Link

http://link.springer.com/content/pdf/10.1134/S1990478916020137.pdf

Reference23 articles.

1. M. K. Gavurin and V. N. Malozemov, Extreme Problems with Linear Constraints (Izd. Leningrad. Univ., Leningrad, 1984) [in Russian].

2. V. F. Demyanov and G. Sh. Tamasyan, “On Direct Methods for Solving Variational Problems,” Trudy Inst. Mat. Mekh. Ural. Otdel. Ross. Akad. Nauk 16 (5), 36–47 (2010).

3. M. V. Dolgopolik and G. Sh. Tamasyan, “On Equivalence of the Methods of Steepest and Hypodifferential Descents in Some Constrained Optimization Problems,” Izv. Saratov. Univ. Ser. Mat. Mekh. Inform. 14 (4-2), 532–542 (2014).

4. V. N. Malozemov, “MDMMethod—40 Years,” Vestnik Syktyvkar. Univ. Ser. 1, No. 15, 51–62(2012).

5. V. N. Malozemov and A. B. Pevnyi, “Fast Algorithm for Projecting a Point on a Simplex,” Vestnik. St.- Peterburg. Univ. Ser. 1, No. 1, 112–113 (1992) [Vestnik St. Petersburg Univ. Math. 25 (1), 62–63 (1992)].

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Projective-Dual Method for Solving Systems of Linear Equations with Nonnegative Variables;Computational Mathematics and Mathematical Physics;2018-02