Trudy Instituta Matematiki i Mekhaniki UrO RAN
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


Trudy Inst. Mat. i Mekh. UrO RAN:
Year:
Volume:
Issue:
Page:
Find




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

Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2016, Volume 22, Number 3, Pages 90–100
DOI: https://doi.org/10.21538/0134-4889-2016-22-3-90-100 (Mi timm1324) 		 
This article is cited in 2 scientific papers (total in 2 papers)

A variant of the dual simplex method for a linear semidefinite programming problem

V. G. Zhadan

Federal Research Center "Computer Science and Control" of Russian Academy of Sciences
Full-text PDF (196 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.21538/0134-4889-2016-22-3-90-100
Abstract: A linear semidefinite programming problem in the standard statement is considered, and a variant of the dual simplex method is proposed for its solution. This variant generalizes the corresponding method for linear programming problems. The transfer from an extreme point of the feasible set to another extreme point is described. The convergence of the method is proved.
Keywords: linear semidefinite programming problem, dual problem, extreme points, dual simplex method.
Funding agency Grant number
Russian Foundation for Basic Research 15-01-08259
Ministry of Education and Science of the Russian Federation НШ-8860.2016.1
Russian Academy of Sciences - Federal Agency for Scientific Organizations I.33 П
Received: 16.05.2016
English version:
Proceedings of the Steklov Institute of Mathematics (Supplementary issues), 2017, Volume 299, Issue 1, Pages 246–256
DOI: https://doi.org/10.1134/S0081543817090267
Bibliographic databases:
Document Type: Article
UDC: 519.856
MSC: 90С22
Language: Russian
Citation: V. G. Zhadan, “A variant of the dual simplex method for a linear semidefinite programming problem”, Trudy Inst. Mat. i Mekh. UrO RAN, 22, no. 3, 2016, 90–100; Proc. Steklov Inst. Math. (Suppl.), 299, suppl. 1 (2017), 246–256
Citation in format AMSBIB
\Bibitem{Zha16}
\by V.~G.~Zhadan
\paper A variant of the dual simplex method for a linear semidefinite programming problem
\serial Trudy Inst. Mat. i Mekh. UrO RAN
\yr 2016
\vol 22
\issue 3
\pages 90--100
\mathnet{http://mi.mathnet.ru/timm1324}
\crossref{https://doi.org/10.21538/0134-4889-2016-22-3-90-100}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3555713}
\elib{https://elibrary.ru/item.asp?id=26530881}
\transl
\jour Proc. Steklov Inst. Math. (Suppl.)
\yr 2017
\vol 299
\issue , suppl. 1
\pages 246--256
\crossref{https://doi.org/10.1134/S0081543817090267}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000425144600025}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85042156205}
Linking options:
  • https://www.mathnet.ru/eng/timm1324
  • https://www.mathnet.ru/eng/timm/v22/i3/p90
    • 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
    		Trudy Instituta Matematiki i Mekhaniki UrO RAN
    Statistics & downloads:
    Abstract page:303
    Full-text PDF :100
    References:42
    First page:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024