A unified approach to zero duality gap for convex optimization problems

In this paper we establish necessary and sufficient condition for zero duality gap of the optimization problem involving the general perturbation mapping via characteringsetunder the convex setting. An application to the class of composite optimization problems will also be given to show that our general results can be applied to various classes of optimization problems.