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 languageEnglish
Title of host publication"Stability and Control Processes" in Memory of V.I. Zubov (SCP), 2015 International Conference
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages353-356
ISBN (Print)9781467376983
DOIs
StatePublished - 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