• DocumentCode
    3701435
  • Title

    Orthogonal projection of a point onto the standard simplex algorithms analysis

  • Author

    Grigoriy Tamasyan;Evgenii Prosolupov

  • Author_Institution
    Saint Petersburg State University, 7/9 Universitetskaya nab., 199034, Russia
  • fYear
    2015
  • Firstpage
    353
  • Lastpage
    356
  • Abstract
    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.
  • Keywords
    "Standards","Sorting","Algorithm design and analysis","Complexity theory","Arrays","Indexes","Electronic mail"
  • Publisher
    ieee
  • Conference_Titel
    "Stability and Control Processes" in Memory of V.I. Zubov (SCP), 2015 International Conference
  • Type

    conf

  • DOI
    10.1109/SCP.2015.7342137
  • Filename
    7342137
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3701435