Approximating quadratic programming with bound and quadratic constraints

被引：155
|
作者：
Ye, YY [1 ]
机构：
[1] Univ Iowa, Dept Management Sci, Iowa City, IA 52242 USA
来源：
MATHEMATICAL PROGRAMMING | 1999年 / 84卷 / 02期
关键词：
quadratic programming; global maximizer; approximation algorithm;
D O I：
10.1007/s10107980012a
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We consider the problem of approximating the global maximum of a quadratic program (QP) subject to bound and (simple) quadratic constraints. Based on several early results, we show that a 4/7-approximate solution can be obtained in polynomial time.
引用
收藏
页码：219 / 226
页数：8
相关论文
共 50 条
12345