一般复合均匀凸优化的强和稳定对偶

Strong and Stable Duality of General Composed Evenly Convex Optimization

在广义凸共轭理论的基础和可分离的局部凸空间的条件下,利用扰动方法和c—共轭方法得到一般复合均匀凸优化问题的对偶问题,并在原问题的基础上再扰动一个连续线性泛函得到其稳定对偶问题.进而在一定的假设条件下,结合函数的均匀凸性,给出保证强对偶和稳定强对偶成立的正则条件.

This paper obtains a dual problem for a general evenly convex optimization problem defined on a separated 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 established under certain assumptions,where the evenly convexity of the perturbation function plays a fundamental role.