KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems

2011 ◽  
Vol 21 (4) ◽  
pp. 1475-1490 ◽  
Author(s):  
Cheng Lu ◽  
Shu-Cherng Fang ◽  
Qingwei Jin ◽  
Zhenbo Wang ◽  
Wenxun Xing
2009 ◽  
Vol 26 (06) ◽  
pp. 769-778 ◽  
Author(s):  
YONG XIA

In this article, we study the convex hull presentation of a quadratically constrained set. Applying the new result, we solve a kind of quadratically constrained quadratic programming problems, which generalizes many well-studied problems.


Sign in / Sign up

Export Citation Format

Share Document