复合凸优化问题的稳定强对偶  

Stable Strong Duality for a Composed Convex Optimization Problem

作　　者：赵丹[1] 孙祥凯[2] 

机构地区：[1]重庆工商大学融智学院,重庆400033 [2]重庆工商大学数学与统计学院,重庆400067

出　　处：《吉林大学学报（理学版）》2013年第3期441-443,共3页Journal of Jilin University:Science Edition

基　　金：国家自然科学基金(批准号:11171362;11201509);重庆市自然科学基金(批准号:cstc2012jjA00033)

摘　　要：先建立复合凸优化问题的对偶问题,然后利用共轭函数上图的性质引入一些新的更弱的约束品性,并借助这些约束品性刻画了复合凸优化问题的稳定强对偶和强对偶.We first introduced the dual schemes for a composed convex optimization problem.Then, using the properties of the epigraph of the conjugated functions,we introduced some new constraint qualifications.Finally,using these constraint qualifications,we obtained some necessary and sufficient conditions which characterize the stable strong and strong dualities for the composed convex optimization problem.

关 键 词：复合凸优化问题 新的约束品性 稳定强对偶 强对偶 

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