Subsequently the paperintroduces the multi-objective optimization technique to convert thenonseparable problems into separable ones using primal-dual algorithm.
接着引入多目标优化技术，利用原始-对偶算法将不可分问题首先转化为可分问题。
参考来源 - 复杂系统的若干问题研究·2,447,543篇论文数据，部分数据来源于NoteExpress
对于有大量变量的问题，原始对偶算法将更为有效。
In case of problems with thousands of variables, the primal-dual algorithm will be far more efficient.
第3章给出无约束极大极小问题的一个对偶算法的收敛理论。
Chapter 3 is devoted to the study of the convergence theory of a dual algorithm for unconstrained minimax problems.
针对目标函数具有递增斜率的分段线性规划问题，提出了一种快速的对偶算法。
A fast dual algorithm is presented for the piecewise linear programming with successively increasing slopes.
应用推荐