Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Zh. Vychisl. Mat. Mat. Fiz.:
Year:
Volume:
Issue:
Page:
Find






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


Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2009, Volume 49, Number 3, Pages 453–464 (Mi zvmmf22)  

This article is cited in 3 scientific papers (total in 3 papers)

Dual multiplicative algorithms for an entropy-linear programming problem

E. V. Gasnikova

Moscow Institute of Physics and Technology (State University), per. Institutskii 9, Dolgoprudnyi, Moscow oblast, 141700, Russia
References:
Abstract: A multiplicative-barrier generalization of the Cauchy gradient descent method is proposed and studied. The technique is used to search for dual variables in the entropy maximization problem with affine constraints, which arises, for example, in the simulation of equilibria in macroscopic systems. For this class of problems, the dual variables can be used to effectively determine the primal ones. The global convergence of the iterative algorithms proposed is proved.
Key words: multiplicative-barrier iterative algorithms, entropy-linear programming problem, dual problem, Lyapunov's indirect method, Lyapunov's direct method.
Received: 17.07.2007
Revised: 28.10.2008
English version:
Computational Mathematics and Mathematical Physics, 2009, Volume 49, Issue 3, Pages 439–449
DOI: https://doi.org/10.1134/S0965542509030063
Bibliographic databases:
Document Type: Article
UDC: 519.852
Language: Russian
Citation: E. V. Gasnikova, “Dual multiplicative algorithms for an entropy-linear programming problem”, Zh. Vychisl. Mat. Mat. Fiz., 49:3 (2009), 453–464; Comput. Math. Math. Phys., 49:3 (2009), 439–449
Citation in format AMSBIB
\Bibitem{Gas09}
\by E.~V.~Gasnikova
\paper Dual multiplicative algorithms for an entropy-linear programming problem
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 2009
\vol 49
\issue 3
\pages 453--464
\mathnet{http://mi.mathnet.ru/zvmmf22}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2559792}
\elib{https://elibrary.ru/item.asp?id=11714010}
\transl
\jour Comput. Math. Math. Phys.
\yr 2009
\vol 49
\issue 3
\pages 439--449
\crossref{https://doi.org/10.1134/S0965542509030063}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000264922900006}
\elib{https://elibrary.ru/item.asp?id=13603662}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-64249147347}
Linking options:
  • https://www.mathnet.ru/eng/zvmmf22
  • https://www.mathnet.ru/eng/zvmmf/v49/i3/p453
  • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Журнал вычислительной математики и математической физики Computational Mathematics and Mathematical Physics
    Statistics & downloads:
    Abstract page:352
    Full-text PDF :127
    References:32
    First page:7
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024