该文在函数不一定下半连续,集合不一定是闭集的条件下,利用函数次微分性质,引进新的约束规范条件,等价刻画了鲁棒复合优化问题的最优性条件以及原问题与其松弛型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.展开更多
文摘该文在函数不一定下半连续,集合不一定是闭集的条件下,利用函数次微分性质,引进新的约束规范条件,等价刻画了鲁棒复合优化问题的最优性条件以及原问题与其松弛型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.
