Izvestiya: Mathematics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Izv. RAN. Ser. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Izvestiya: Mathematics, 2009, Volume 73, Issue 1, Pages 3–19
DOI: https://doi.org/10.1070/IM2009v073n01ABEH002435 (Mi im1025) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Convergence of a numerical abstract convexity algorithm

M. Yu. Andramonov

St. Petersburg State University, Faculty of Applied Mathematics and Control Processes
English version PDF (259 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.1070/IM2009v073n01ABEH002435
Abstract: We propose a series of algorithms for solving abstract convex programming problems and prove convergence to the global solution of the problem. The algorithms use an approximation of the objective function by piecewise-linear minorants.
Keywords: convex analysis, global optimization, branching algorithm, generalized cutting-plane method.
Received: 04.04.2006
Revised: 11.01.2008
Russian version:
Izvestiya Rossiiskoi Akademii Nauk. Seriya Matematicheskaya, 2009, Volume 73, Issue 1, Pages 5–20
DOI: https://doi.org/10.4213/im1025
Bibliographic databases:
UDC: 519.6
MSC: Primary 90C26; Secondary 90C30
Language: English
Original paper language: Russian
Citation: M. Yu. Andramonov, “Convergence of a numerical abstract convexity algorithm”, Izv. RAN. Ser. Mat., 73:1 (2009), 5–20; Izv. Math., 73:1 (2009), 3–19
Citation in format AMSBIB
\Bibitem{And09}
\by M.~Yu.~Andramonov
\paper Convergence of a numerical abstract convexity algorithm
\jour Izv. RAN. Ser. Mat.
\yr 2009
\vol 73
\issue 1
\pages 5--20
\mathnet{http://mi.mathnet.ru/im1025}
\crossref{https://doi.org/10.4213/im1025}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2503118}
\zmath{https://zbmath.org/?q=an:05553989}
\adsnasa{https://adsabs.harvard.edu/cgi-bin/bib_query?2009IzMat..73....3A}
\elib{https://elibrary.ru/item.asp?id=20358662}
\transl
\jour Izv. Math.
\yr 2009
\vol 73
\issue 1
\pages 3--19
\crossref{https://doi.org/10.1070/IM2009v073n01ABEH002435}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000264628800001}
\elib{https://elibrary.ru/item.asp?id=13610162}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-65349165385}
Linking options:
  • https://www.mathnet.ru/eng/im1025
  • https://doi.org/10.1070/IM2009v073n01ABEH002435
  • https://www.mathnet.ru/eng/im/v73/i1/p5
    • 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
    		Известия Российской академии наук. Серия математическая Izvestiya: Mathematics
    Statistics & downloads:
    Abstract page:500
    Russian version PDF:224
    English version PDF:11
    References:51
    First page:18
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024