Strong and Stable Duality of General Composed Evenly Convex Optimization
This paper obtains a dual problem for a general evenly convex optimization problem defined on a separat-ed locally convex space,via perturbational approach and using a conjugation scheme called c-conjugation.This scheme is based on the generalized convex conjugation theory.Regularity conditions guaranteeing strong duality for primal problems which are perpetuated by continuous linear functional and its dual problems,which is named stable strong duality,are es-tablished under certain assumptions,where the evenly convexity of the perturbation function plays a fundamental role.
NETL
NSTL
万方数据
