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, 2008, Volume 48, Number 2, Pages 255–263 (Mi zvmmf181)  
This article is cited in 2 scientific papers (total in 2 papers)

The method of feasible directions for mathematical programming problems with preconvex constraints

V. I. Zabotin, T. F. Minnibaev

Kazan State Technological University, ul. Karla Marksa 10, Kazan, 420015, Tatarstan, Russia
Full-text PDF (851 kB) Citations (2)
References:
PDF
HTML
Abstract: The convergence of the method of feasible directions is proved for the case of the smooth objective function and a constraint in the form of the difference of convex sets (the so-called preconvex set). It is shown that the method converges to the set of stationary points, which generally is narrower than the corresponding set in the case of a smooth function and smooth constraints. The scheme of the proof is similar to that proposed earlier by Karmanov.
Key words: mathematical programming problems with preconvex constraints, classical method of feasible directions, method convergence.
Received: 12.04.2007
English version:
Computational Mathematics and Mathematical Physics, 2008, Volume 48, Issue 2, Pages 242–250
DOI: https://doi.org/10.1007/s11470-008-2007-1
Bibliographic databases:
Document Type: Article
UDC: 519.853
Language: Russian
Citation: V. I. Zabotin, T. F. Minnibaev, “The method of feasible directions for mathematical programming problems with preconvex constraints”, Zh. Vychisl. Mat. Mat. Fiz., 48:2 (2008), 255–263; Comput. Math. Math. Phys., 48:2 (2008), 242–250
Citation in format AMSBIB
\Bibitem{ZabMin08}
\by V.~I.~Zabotin, T.~F.~Minnibaev
\paper The method of feasible directions for mathematical programming problems with preconvex constraints
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 2008
\vol 48
\issue 2
\pages 255--263
\mathnet{http://mi.mathnet.ru/zvmmf181}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2426461}
\zmath{https://zbmath.org/?q=an:05282419}
\transl
\jour Comput. Math. Math. Phys.
\yr 2008
\vol 48
\issue 2
\pages 242--250
\crossref{https://doi.org/10.1007/s11470-008-2007-1}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000262227700007}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-41549158174}
Linking options:
  • https://www.mathnet.ru/eng/zvmmf181
  • https://www.mathnet.ru/eng/zvmmf/v48/i2/p255
    • 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
    		Журнал вычислительной математики и математической физики Computational Mathematics and Mathematical Physics
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025