1) concave-convex separation
凹凸分离
1.
Firstly,the indefinite quadratic programming was preconditioned by generalized Cholesky factorization,then concave-convex separation was carried out and the branch and bound algorithm was used to solve the last problem.
首先利用广义Cholesky分解对该类不定二次规划问题进行预处理,然后进行凹凸分离并用常见的分枝定界法进行求解。
2) convex and concave analysis
凹凸分析
3) Concave and protruding analysis
凹凸性分析
4) detaching cam
分离凸轮
5) separated convex set
分离凸集
6) matched parting
凸凹的分型面
补充资料：凹凸
1.凹陷和凸起;高低不平。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条