(h,φ)-凸规划的对偶间隙

Dual Gap of (h,φ)-Convex Programming

本文讨论了(h,φ)-凸规划的Lagrange对偶问题,并证明了(h,φ)-凸规划与Lagrange对偶之间无对偶间隙的充要条件。

This paper discusses the Lagrange＇s dual problem of（h,φ）-convex programming.It is proved that a sufficient and necessary condition of no dual gap between（h,φ）-convex programming and Lagrange＇s dual problem.