DC规划的一些结论及推广  

Some Conclusions and Generalization of DC Programming

作　　者：付裕[1] 马琳晶 李科科[1] 

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

出　　处：《重庆理工大学学报（自然科学）》2016年第10期163-168,共6页Journal of Chongqing University of Technology：Natural Science

基　　金：重庆市研究生创新训练项目(CYS16144)

摘　　要：针对DC(difference of convex)规划,结合最优化理论和算法的相关知识,用不同的方法对DC规划中已有的一些定理和结论进行了证明。在此基础上,对其中一些结论进行了推广,并且阐述了一类DC规划和其对应的反凸规划的最优解之间的联系。最后利用L-次微分等相关知识,提出并讨论了一类特殊DC规划和其相关的一类凸规划的最优解之间的联系与区别。For DC（ difference of convex） programming,some theorems and conclusions of it were proved combined with the relevant knowledge of the optimization theory and method by using different methods. And on this basis,some of these conclusions have promoted. Furthermore,we expounded the relationship of the optimal solution between the type of DC programming and their corresponding reverse convex programming. Finally,the relation and difference between the optimal solutions of a special class of DC programming and its related convex programming were presented and discussed by using the knowledge of L-subdifferential and other related knowledge.

关 键 词：最优化理论和算法 DC规划 反凸规划 最优解 

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