%0 Journal Article
%T DC 型均匀凸优化问题的最优性条件和全对偶<br>Optimality Conditons and Total Dualities for DC Type Evenly Convex Optimization Problems
%A 陈泓烨
%J Advances in Applied Mathematics
%P 9-22
%@ 2324-8009
%D 2025
%I Hans Publishing
%R 10.12677/AAM.2025.145228
%X 利用c-次微分概念，引入新的约束规范条件，给出了带DC型不等式的均匀凸优化问题的最优性条 件，同时利用均匀凸函数的性质，定义了原问题的Lagrange对偶问题，利用函数的c-共轭上图性 质，刻画了原问题与其Lagrange对偶问题之间的全对偶。<br>By using the concept of c-subdifferential and introducing new constraint qualification-s, the optimality conditions for evenly convex optimization problems with DC type inequalities are given. At the same time, the Lagrange dual problem of the prime problem is defined by utilizing the properties of evenly convex functions. By utilizing the c-conjugate graph property of functions, the total dual problem between the prime problem and its Lagrange dual problem is depicted.
%K 均匀凸优化问题，最优性条件，全对偶<br>Evenly Vonvex Optimization Problem
%K Optimality Condition
%K Total Duality
%U http://www.hanspub.org/journal/PaperInformation.aspx?PaperID=113640