凸对偶 meaning in Chinese

convex duality

In the progress of deducing the dual of these two problems using the knowledge of convex programming and generalized fenchel theory , you can find lagrange dual of the two programming by lagrange dual in nonlinear programming in this article
基于凸规划知识和广义的fenchel定理，作者推导出这两类问题的凸对偶规划。同时，发现由非线性规划中lagrange对偶可以获得这两类问题的lagrange对偶规划，且推导过程中没有涉及很深的数学知识，使得应用更为广泛。