Orthogonal projection of a point onto the standard simplex algorithms analysis

Links

http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7342137&newsearch=true&searchWithin=%22Last%20Name%22:Tamasyan%5C

DOI

https://doi.org/10.1109/SCP.2015.7342137
Other version

G. Tamasyan
E. Prosolupov
A. P. Zhabko (Editor)
L.A. Petrosyan

In this paper a comparative study of the time complexity of two “fast” algorithms for projecting a point onto the standard simplex is presented. Methods of Maculan-de Paula and Malozemov-Pevnyi, as well as two modifications of Malozemov-Pevnyi are considered. From the results of numerical experiments we can conclude that one of presented modifications of Malozemov-Pevnyi algorithm is practical.

Original language	English
Title of host publication	"Stability and Control Processes" in Memory of V.I. Zubov (SCP), 2015 International Conference
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	353-356
ISBN (Print)	9781467376983
DOIs	https://doi.org/10.1109/SCP.2015.7342137
State	Published - 2015

Research areas

optimisation, Malozemov-Pevnyi algorithm, Malozemov-Pevnyi modifications, orthogonal projection, standard simplex algorithms analysis, Algorithm design and analysis, Arrays, Complexity theory, Electronic mail, Indexes, Sorting, Standards

ID: 3984529