法锥条件下非凸规划组合同伦算法的复杂性分析  

Complexity Analysis for the Homotopy Method of Non-convex Programming under Normal Cone Conditions

作　　者：刘巍[1,2] 薛冬梅[1] 

机构地区：[1]吉林化工学院理学院,吉林吉林132022 [2]吉林大学数学学院,长春130012

出　　处：《吉林大学学报（理学版）》2014年第6期1203-1206,共4页Journal of Jilin University:Science Edition

基　　金：吉林省自然科学基金(批准号:201215128)

摘　　要：考虑非凸规划组合同伦算法的复杂性问题,假设目标函数在一个相当大的范围内有界,避免了可行域非凸情形下算法产生的迭代点列不在可行域内的情形,并证明了可行域满足法锥条件时非凸规划组合同伦算法的复杂性,得到了相应的估计结果.The complexity of the case of non-convex programming problem homotopy algorithm was researched.We assumed the objective function to be bounded in a fairly large range so as to avoid the non-convex case of feasible region.The algorithm generated iterate column is not in the feasible domain.We proved the complexity of non-convex cone planning group homotopy algorithm when the feasible region satisfied the normal cone conditions and got the corresponding estimates.

关 键 词：非凸规划 同伦算法 复杂性分析 

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