J4 ›› 2013, Vol. 51 ›› Issue (03): 441-443.

Previous Articles     Next Articles

Stable Strong Duality for a Composed Convex Optimization Problem

ZHAO Dan1, SUN Xiangkai2   

  1. 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
  • Received:2012-09-25 Online:2013-05-26 Published:2013-05-17
  • Contact: SUN Xiangkai E-mail:sxkcqu@163.com

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.

Key words:  composed convex optimization problem, new constraint qualifications, stable strong duality, strong duality

CLC Number: 

  • O221.6