Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, 2016, Volume 23, Issue 2, Pages 100–123
DOI: https://doi.org/10.17377/daio.2016.23.510 (Mi da847) 		 
This article is cited in 2 scientific papers (total in 2 papers)

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

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

St. Petersburg State University, 35 University Ave., 198504 Peterhof, Russia
Full-text PDF (482 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.17377/daio.2016.23.510
Abstract: 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.
Funding agency Grant number
Saint Petersburg State University 9.38.205.2014
Russian Foundation for Basic Research 14-01-31521_мол_а
Received: 11.09.2015
Revised: 19.10.2015
English version:
Journal of Applied and Industrial Mathematics, 2016, Volume 10, Issue 2, Pages 288–301
DOI: https://doi.org/10.1134/S1990478916020137
Bibliographic databases:
Document Type: Article
UDC: 519.85
Language: Russian
Citation: G. Sh. Tamasyan, E. V. Prosolupov, T. A. Angelov, “Comparative study of two fast algorithms for projecting a point to the standard simplex”, Diskretn. Anal. Issled. Oper., 23:2 (2016), 100–123; J. Appl. Industr. Math., 10:2 (2016), 288–301
Citation in format AMSBIB
\Bibitem{TamProAng16}
\by G.~Sh.~Tamasyan, E.~V.~Prosolupov, T.~A.~Angelov
\paper Comparative study of two fast algorithms for projecting a~point to the standard simplex
\jour Diskretn. Anal. Issled. Oper.
\yr 2016
\vol 23
\issue 2
\pages 100--123
\mathnet{http://mi.mathnet.ru/da847}
\crossref{https://doi.org/10.17377/daio.2016.23.510}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3557596}
\elib{https://elibrary.ru/item.asp?id=26129771}
\transl
\jour J. Appl. Industr. Math.
\yr 2016
\vol 10
\issue 2
\pages 288--301
\crossref{https://doi.org/10.1134/S1990478916020137}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84971247579}
Linking options:
  • https://www.mathnet.ru/eng/da847
  • https://www.mathnet.ru/eng/da/v23/i2/p100
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:570
    Full-text PDF :90
    References:44
    First page:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024