Nondifferentiable exact penalty functions are used to transform a constrained optimization problem into a single unconstrained optimization problem.
借助不可微精确罚函数把约束问题转化为单个无约束问题来处理。
In convex programming theory, a constrained optimization problem, by KT conditions, is usually converted into a mixed nonlinear complementarity problem.
在凸规划理论中，通过KT条件，往往将约束最优化问题归结为一个混合互补问题来求解。
Based on the minimum output energy criterion, the algorithm is formulated as a constrained optimization problem inherently and is then resolved efficiently by using neural network.
这种盲检测算法基于最小平均输出能量准则，本质上是一个有约束的最优化问题。
应用推荐