Transform a Kind of Positive Semi-Definite Quadratic Programming into Positive Definite Quadratic Programming

被引：0
|
作者：
Wang, Mingyu [1 ]
机构：
[1] Xian Univ Finance & Econ, Sch Informat, Xian, Peoples R China
来源：
2012 THIRD INTERNATIONAL CONFERENCE ON THEORETICAL AND MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE (ICTMF 2012) | 2013年 / 38卷
关键词：
Quadratic Programming; Positive Definite; Positive Semi-Definite; Relaxation Method;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
For a kind of positive semi-definite quadratic programming, a method to transform the original problem into serial positive definite quadratic programming under certain conditions is described. Thus the positive semi-definite quadratic programming can be solved as positive definite quadratic programming. An iterative algorithm for solving sequence positive definite quadratic programming is constructed, and the algorithm can be stop in limited steps.
引用
收藏
页码：95 / 99
页数：5
相关论文
共 50 条
12345