凸化 meaning in Chinese
convexification
Examples
- In this thesis , i simplified this problem into the problem to calculate the nfp of two convex polygons by decomposing the non - convex polygon into convex polygon
本文提出了多边形凸化分割的方法，将求解两个凹多边形的nfp问题转化为求解两个凸多边形的nfp问题，并加以理论证明，成功地解决了这一问题。 - This algorithm overcomes the deficiency of present methods in two aspects : ( 1 ) by introducing the mass matrix into optimal variable , the method broad the range of the optimization ; ( 2 ) to solve the optimal problem with nonconvex constraint induced by control in structure , convexifying potential function is used to make the nonconvex constraint part to be convex , that reduce the complex of the algorithm greatly
该算法在以下两个方面突破了现有算法的局限性：将质量矩阵纳入优化变量，拓宽了优化范围；采用凸化势能函数处理将控制引入结构设计导致的非凸约束，大大降低了算法复杂度。 - Abstract firstly , convert a programming problem with multiple constraints into a programming problem with single constraint , secondly , several convexification and concavification transformations for the constrained problem with strictly monotone constraint functions are proposed according to the transformed problem with single constraint , then this constrained programming problem can be converted into a concave minimization or a reverse convex programming problem
摘要首先将一个具有多个约束的规划问题转化为一个只有一个约束的规划问题，然后通过利用这个单约束的规划问题，对原来的多约束规划问题提出了一些凸化、凹化的方法，这样这些多约束的规划问题可以被转化为一些凹规划、反凸规划同题。