摘要
本文分别考虑带非负约束和不带非负约束凸二次规划问题逆问题．首先得到各个逆问题的数学模型，然后对不同的模型给出不同的求解方法．
In this paper the inverse problems for convex quadratic programming with and without nonnegative constrains are considered.First mathematical model for two inverse problems are considered,then the corresponding methods for solving the problems are presented.
出处
《运筹学学报》
CSCD
2000年第4期88-94,共7页
Operations Research Transactions
基金
国家自然科学基金!(69772017)
教育部博士点基金!(97042207)
关键词
凸二次规划
逆问题
半定规划
内点算法
非负约束
convex quadratic programming, inverse problem,semidefinite programming, interior point algorit\
