conjugate convex function

Constructing the dual programming of a conic programming with a conjugate function;

由共轭函数构造锥规划的对偶规划

This paper presents three kinds of conjugate functions which are relative to the objective function of a non-convex optimization problem with constraint condition.

建立与带约束的非凸优化问题目标函数有关的几种共轭函数,研究与之关联的Lagrange对偶问题、Fenchel对偶问题和二者结合的Fenchel-Lagrange等3种共轭对偶问题,对这些对偶问题的最优目标值进行了比较。

According to the property of conjugate function and DC programming,the conjugate duality of a special kind of DC programming is discused.

根据共轭函数和DC规划的性质 ,给出一类特殊DC规划的共轭对偶并讨论其对偶规划的特殊性质 ,然后利用该性质 ,把对这类特殊DC规划的求解转化为对一个凸规划的求解。