1) strong duality
强对偶
1.
the weak and strong duality theorems are established under higher-order V-invexity assumption.
Rueda所做工作的基础上,对于上述高阶对偶模型建立了高阶V-不变凸条件下的弱埘偶和强对偶理论。
2.
The concepts of higher order η-invexity and higher order η-quasi-invexity are adopted in order to discuss weak and strong duality theorems.
最后,在高阶η-不变凸和高阶η-不变拟凸的条件下讨论该对偶模型的弱对偶和强对偶定理。
2) Weak(strong) duality
强(弱)对偶
3) less(much) dual
弱(强)对偶
4) strong duality
强对偶性
1.
The paper sets up a new dual problem of a nondifferentiable convex programming problem and proves its dual properties such as weak duality, strong duality and converse duality.
本文对非可微凸规划问题建立了一个新的对偶问题 ,并证明其对偶性质 ,如弱对偶性 ,强对偶性及逆对偶性。
2.
In this paper,we set up a new dual problem for nondifferentiable convex programming which is different from well known dual problems and prove the weak duality and the strong duality.
文章建立关于非可微凸规划的一个新的对偶问题，它不同于已知的对偶问题，文中证明了弱对偶性及强对偶性。
3.
This paper sets up a dual problem for nondifferentiable convex programming with equality constraints and proves the weak duality and strong duality.
本文建立带有等式约束的非可微凸规划的新的对偶问题，证明了其弱对偶性及强对偶性，并讨论了强对偶性与 Ｌａｇｒａｎｇｅ 因子的关系。
5) weak duality and strong duality
弱对偶与强对偶
6) strong dual space
强对偶空间
补充资料：椐椐强强
1.相随貌。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条