首页 | 本学科首页   官方微博 | 高级检索  
     检索      

复合凸优化问题的稳定强对偶
引用本文:赵丹,孙祥凯.复合凸优化问题的稳定强对偶[J].吉林大学学报(理学版),2013,51(3):441-443.
作者姓名:赵丹  孙祥凯
作者单位:1. 重庆工商大学融智学院, 重庆 400033; 2. 重庆工商大学 数学与统计学院, 重庆 400067
基金项目:国家自然科学基金(批准号:11171362;11201509);重庆市自然科学基金(批准号:cstc2012jjA00033)
摘    要:先建立复合凸优化问题的对偶问题, 然后利用共轭函数上图的性质引入一些新的更弱的约束品性, 并借助这些约束品性刻画了复合凸优化问题的稳
定强对偶和强对偶.

关 键 词:复合凸优化问题    新的约束品性    稳定强对偶    强对偶  
收稿时间:2012-09-25

Stable Strong Duality for a Composed Convex Optimization Problem
ZHAO Dan,SUN Xiang-kai.Stable Strong Duality for a Composed Convex Optimization Problem[J].Journal of Jilin University: Sci Ed,2013,51(3):441-443.
Authors:ZHAO Dan  SUN Xiang-kai
Institution:1. Rongzhi College of Chongqing Technology and Business University, Chongqing 400033, China;2. College of Mathematics and Statistics, Chongqing Technology and Business University, Chongqing 400067, China
Abstract: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.
Keywords:composed convex optimization problem  new constraint qualifications  stable strong duality  strong duality
本文献已被 CNKI 等数据库收录!
点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息
点击此处可从《吉林大学学报(理学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号