带二元约束非凸三次优化问题的全局充分条件  

Global Sufficient Condition for Non-convex Cubic Optimization Problems with Binary Constraints

作　　者：张亮[1] 

机构地区：[1]重庆师范大学数学学院,重庆401331

出　　处：《重庆工商大学学报（自然科学版）》2014年第9期6-9,共4页Journal of Chongqing Technology and Business University:Natural Science Edition

基　　金：国家自然科学基金(10971241)

摘　　要：将一类特殊的带有{-1,1}二元约束的非凸三次优化问题等价转化为带有{-1,1}二元约束的非凸二次规划问题,并利用Rockafellar在文献《Convex Analysis》中给出的经典对偶理论,提出了该非凸二次规划问题的全局充分条件,进而得到了刻画带{-1,1}二元约束的非凸三次优化问题全局充分条件.A class of special non-convex cubic optimization problems with {-1,1} binary constraints is equivalently transformed into non-convex quadratic programming problems with {- 1,1 } binary problems, the global sufficient condition for this non-convex quadratic programming problems is proposed based on Rockafellar＇ s classic duality theory in the reference of Convex Analysis, and global sufficient condition for the description of non-convex cubic optimization problems with {- 1,1 } binary constraints is further received.

关 键 词：三次极小化问题 全局最优性条件 二元约束 

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