In convex programming theory, a constrained optimization problem, by KT conditions, is usually converted into a mixed nonlinear complementarity problem.
在凸规划理论中，通过KT条件，往往将约束最优化问题归结为一个混合互补问题来求解。
In convex programming theory, a constrained optimization problem, by KT conditions, is usually converted into a mixed nonlinear complementarity problem.
在凸规划理论中，通过KT条件，往往将约束最优化问题归结为一个混合互补问题来求解。
应用推荐