Email this article A Variant of the Dual Simplex Method for a Linear Semidefinite Programming Problem
- Authors: Zhadan V.G.1
-
Affiliations:
- Dorodnitsyn Computing Center of the Russian Academy of Sciences
- Issue: Vol 299, No Suppl 1 (2017)
- Pages: 246-256
- Section: Article
- URL: https://journals.rcsi.science/0081-5438/article/view/175383
- DOI: https://doi.org/10.1134/S0081543817090267
- ID: 175383
Cite item
Open Access
Access granted
Subscription Access
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 used 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.
About the authors
V. G. Zhadan
Dorodnitsyn Computing Center of the Russian Academy of Sciences
Author for correspondence.
Email: zhadan@ccas.ru
Russian Federation, Moscow, 119333
Supplementary files
