Sufficient Conditions for Global Optimality of Bivalent Nonconvex Quadratic Programs with Inequality Constraints

被引：0
|
作者：
Z. Y. Wu
V. Jeyakumar
A. M. Rubinov
机构：
[1] Chongqing Normal University,Department of Mathematics
[2] University of New South Wales,Department of Applied Mathematics
[3] University of Ballarat,School of Information Technology and Mathematical Sciences
来源：
Journal of Optimization Theory and Applications | 2007年 / 133卷
关键词：
Quadratic optimization; Quadratic inequality constraints; Binary constraints; Global optimality; Sufficient conditions;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We present sufficient conditions for the global optimality of bivalent nonconvex quadratic programs involving quadratic inequality constraints as well as equality constraints. By employing the Lagrangian function, we extend the global subdifferential approach, developed recently in Jeyakumar et al. (J. Glob. Optim., 2007, to appear; Math. Program. Ser. A, 2007, to appear) for studying bivalent quadratic programs without quadratic constraints, and derive global optimality conditions.
引用
收藏
页码：123 / 130
页数：7
相关论文
共 50 条
12345