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


Zh. Vychisl. Mat. Mat. Fiz., 1987, Volume 27, Number 3, Pages 377–384 (Mi zvmmf3859)  

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

An algorithm of simplex imbeddings in convex programming

E. G. Antsiferov, V. P. Bulatov

Irkutsk

Full text: PDF file (767 kB)

English version:
USSR Computational Mathematics and Mathematical Physics, 1987, 27:2, 36–41

Bibliographic databases:

UDC: 519.853.3
MSC: Primary 90C25; Secondary 65K05
Received: 25.04.1984
Revised: 14.07.1986

Citation: E. G. Antsiferov, V. P. Bulatov, “An algorithm of simplex imbeddings in convex programming”, Zh. Vychisl. Mat. Mat. Fiz., 27:3 (1987), 377–384; U.S.S.R. Comput. Math. Math. Phys., 27:2 (1987), 36–41

Citation in format AMSBIB
\Bibitem{AntBul87}
\by E.~G.~Antsiferov, V.~P.~Bulatov
\paper An algorithm of simplex imbeddings in convex programming
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 1987
\vol 27
\issue 3
\pages 377--384
\mathnet{http://mi.mathnet.ru/zvmmf3859}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=890092}
\zmath{https://zbmath.org/?q=an:0665.90072}
\transl
\jour U.S.S.R. Comput. Math. Math. Phys.
\yr 1987
\vol 27
\issue 2
\pages 36--41
\crossref{https://doi.org/10.1016/0041-5553(87)90152-2}


Linking options:
  • http://mi.mathnet.ru/eng/zvmmf3859
  • http://mi.mathnet.ru/eng/zvmmf/v27/i3/p377

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. V. P. Bulatov, N. I. Fedurina, “Ob odnom effektivnom metode vypuklogo programmirovaniya”, Diskretn. analiz i issled. oper., ser. 2, ser. 2, 11:1 (2004), 51–61  mathnet  mathscinet  zmath
    2. T. I. Belykh, V. P. Bulatov, “Methods of support cones and simplices in convex programming and their applications to physicochemical systems”, Comput. Math. Math. Phys., 48:11 (2008), 1955–1970  mathnet  crossref  mathscinet  isi
    3. V. P. Bulatov, “Method of orthogonal simplexes and its applications to convex programming”, Comput. Math. Math. Phys., 48:4 (2008), 577–589  mathnet  crossref  mathscinet  zmath  isi
    4. T. I. Belykh, V. P. Bulatov, È. N. Yas'kova, “Methods of Chebyshev points of convex sets and their applications”, Comput. Math. Math. Phys., 48:1 (2008), 16–29  mathnet  crossref  mathscinet  zmath  isi
    5. V. P. Bulatov, T. I. Belykh, E. N. Yaskova, “Effektivnye metody resheniya zadach vypuklogo programmirovaniya, ispolzuyuschie pogruzhenie dopustimogo mnozhestva v simpleksy”, Diskretn. analiz i issled. oper., 15:3 (2008), 3–10  mathnet  mathscinet  zmath
    6. O. V. Khamisov, “Razvitie metodov optimizatsii v rabotakh V. P. Bulatova”, Izvestiya Irkutskogo gosudarstvennogo universiteta. Seriya Matematika, 4:2 (2011), 6–15  mathnet
    7. A. V. Kolosnitsyn, “Primenenie modifitsirovannogo metoda simpleksnykh pogruzhenii dlya resheniya spetsialnogo klassa zadach vypukloi nedifferentsiruemoi optimizatsii”, Izvestiya Irkutskogo gosudarstvennogo universiteta. Seriya Matematika, 11 (2015), 54–68  mathnet
  • Журнал вычислительной математики и математической физики Computational Mathematics and Mathematical Physics
    Number of views:
    This page:175
    Full text:96
    First page:1

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021