New semidefinite programming relaxations for box constrained quadratic program  

作　　者：XIA Yong 

机构地区：[1]State Key Laboratory of Software Development Environment,LMIB of the Ministry of Education,School of Mathematics and System Sciences,Beihang University

出　　处：《Science China Mathematics》2013年第4期877-886,共10页中国科学：数学（英文版）

基　　金：supported by National Natural Science Foundation of China(Grant Nos. 11001006 and 91130019/A011702);the Fund of State Key Laboratory of Software Development Environment (Grant No. SKLSDE-2011ZX-15.)

摘　　要：We establish in this paper optimal parametric Lagrangian dual models for box constrained quadratic program based on the generalized D.C.(difference between convex) optimization approach,which can be reformulated as semidefinite programming problems.As an application,we propose new valid linear constraints for rank-one relaxation.We establish in this paper optimal parametric Lagrangian dual models for box constrained quadratic program based on the generalized D.C. （difference between convex） optimization approach, which can be refor- mulated as semidefinite programming problems. As an application, we propose new valid linear constraints for rank-one relaxation.

关 键 词：box constrained quadratic program Lagrangian dual semidefinite programming D.C. optimiza- tion lower bound ZONOTOPE 

分 类 号：O221[理学—运筹学与控制论]