Geodesic
A variant of the dual simplex method for a linear semidefinite programming problem
Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 22 (2016) no. 3, pp. 90-100

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{TIMM_2016_22_3_a8,
     author = {V. G. Zhadan},
     title = {A variant of the dual simplex method for a linear semidefinite programming problem},
     journal = {Trudy Instituta matematiki i mehaniki},
     pages = {90--100},
     publisher = {mathdoc},
     volume = {22},
     number = {3},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TIMM_2016_22_3_a8/}
}
TY  - JOUR
AU  - V. G. Zhadan
TI  - A variant of the dual simplex method for a linear semidefinite programming problem
JO  - Trudy Instituta matematiki i mehaniki
PY  - 2016
SP  - 90
EP  - 100
VL  - 22
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TIMM_2016_22_3_a8/
LA  - ru
ID  - TIMM_2016_22_3_a8
ER  - 
%0 Journal Article
%A V. G. Zhadan
%T A variant of the dual simplex method for a linear semidefinite programming problem
%J Trudy Instituta matematiki i mehaniki
%D 2016
%P 90-100
%V 22
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TIMM_2016_22_3_a8/
%G ru
%F TIMM_2016_22_3_a8
V. G. Zhadan. A variant of the dual simplex method for a linear semidefinite programming problem. Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 22 (2016) no. 3, pp. 90-100. http://geodesic.mathdoc.fr/item/TIMM_2016_22_3_a8/