本文研究了带不等式约束的DC型切向凸优化问题的混合型对偶。首先利用约束规范条件建立了混合型对偶模型。其次,利用伪凸函数的性质建立了带不等式约束的DC型切向凸优化问题的弱对偶定理、强对偶定理和逆对偶定理。并且推广了前人已有...本文研究了带不等式约束的DC型切向凸优化问题的混合型对偶。首先利用约束规范条件建立了混合型对偶模型。其次,利用伪凸函数的性质建立了带不等式约束的DC型切向凸优化问题的弱对偶定理、强对偶定理和逆对偶定理。并且推广了前人已有的结论。In this paper, we study mixed-type duality for DC-type tangentially convex optimization problems with inequality constraints. Firstly, we introduce constraint qualification conditions to establish a mixed-type dual model. Subsequently, leveraging properties of pseudoconvex functions, we derive weak duality, strong duality, and converse duality theorems for the proposed optimization problem. Furthermore, our results generalize and extend existing conclusions from prior studies.展开更多
该文在函数不一定下半连续,集合不一定是闭集的条件下,利用函数次微分性质,引进新的约束规范条件,等价刻画了鲁棒复合优化问题的最优性条件以及原问题与其松弛型Fenchel-Lagrange对偶问题之间的全对偶。In the case when the functions ...该文在函数不一定下半连续,集合不一定是闭集的条件下,利用函数次微分性质,引进新的约束规范条件,等价刻画了鲁棒复合优化问题的最优性条件以及原问题与其松弛型Fenchel-Lagrange对偶问题之间的全对偶。In the case when the functions are not necessarily lower semicontinuous and the sets are not necessarily closed, by using the properties of subdifferential of functions, we introduce some new weaker constraint qualifications. Under those constraint qualifications, the total duality and optimality condition between the robust composite convex optimization problem and its relaxed Fenchel-Lagrange dual problem are established.展开更多
文摘本文研究了带不等式约束的DC型切向凸优化问题的混合型对偶。首先利用约束规范条件建立了混合型对偶模型。其次,利用伪凸函数的性质建立了带不等式约束的DC型切向凸优化问题的弱对偶定理、强对偶定理和逆对偶定理。并且推广了前人已有的结论。In this paper, we study mixed-type duality for DC-type tangentially convex optimization problems with inequality constraints. Firstly, we introduce constraint qualification conditions to establish a mixed-type dual model. Subsequently, leveraging properties of pseudoconvex functions, we derive weak duality, strong duality, and converse duality theorems for the proposed optimization problem. Furthermore, our results generalize and extend existing conclusions from prior studies.
文摘该文在函数不一定下半连续,集合不一定是闭集的条件下,利用函数次微分性质,引进新的约束规范条件,等价刻画了鲁棒复合优化问题的最优性条件以及原问题与其松弛型Fenchel-Lagrange对偶问题之间的全对偶。In the case when the functions are not necessarily lower semicontinuous and the sets are not necessarily closed, by using the properties of subdifferential of functions, we introduce some new weaker constraint qualifications. Under those constraint qualifications, the total duality and optimality condition between the robust composite convex optimization problem and its relaxed Fenchel-Lagrange dual problem are established.
