On a variant of the simplex method for a linear semidefinite programming problem

被引：0
作者：
Zhadan, V. G.
机构：
来源：
TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN | 2015年 / 21卷 / 03期
关键词：
linear semidefinite programming problem; extreme points; primal simplex-type method;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A linear semidefinite programming problem is considered. A variant of the primal simplex method, which generalizes the corresponding method for linear programming problems, is proposed for this problem. A passage from an extreme point of the admissible set to another extreme point is described.
引用
收藏
页码：117 / 127
页数：11
相关论文
共 11 条
  • [1] Alizadeh F., 1997, MATH PROGRAM B, V7, P129
  • [2] Arnold VI, 1971, USP MAT NAUK, V26, P101
  • [3] EREMIN II, 1999, TEORIYA LINEINOI OPT
  • [4] Kosolap AI, 2009, VESTN DONETSK NATS A, V2, P365
  • [5] Linear programming with positive semi-definite matrices
    Lasserre, JB
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 1996, 2 (06) : 499 - 522
  • [6] MAGNUS YR, 2002, MATRICHNOE DIFFERENT
  • [7] Pataki G., 1996, P C INT PROGR COMB O, P1
  • [8] Vanderbei R. J., 1997, LINEAR PROGRAMMING F
  • [9] VASILEV FP, 2008, LINEINOE PROGRAMMIRO
  • [10] Wolkowicz H., 2000, HDB SEMIDEFINITE PRO
12