期刊
SIAM JOURNAL ON OPTIMIZATION
卷 21, 期 4, 页码 1475-1490出版社
SIAM PUBLICATIONS
DOI: 10.1137/100793955
关键词
quadratically constrained quadratic programming; conic programming; global optimality condition; solvable condition
资金
- National Natural Science Foundation of China [10801087, 11171177]
- Chinese Ministry of Education [108005]
- US National Science Foundation [DMI-0553310]
- NCSU
To find a global optimal solution to the quadratically constrained quadratic programming problem, we explore the relationship between its Lagrangian multipliers and related linear conic programming problems. This study leads to a global optimality condition that is more general than the known positive semidefiniteness condition in the literature. Moreover, we propose a computational scheme that provides clues of designing effective algorithms for more solvable quadratically constrained quadratic programming problems.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据