This article presents a branch and bound algorithm for globally solving the sum of convex-convex ratios problem with nonconvex feasible region.
本文针对一类带有反凸约束的凸函数比式和问题提出了一种求其全局最优解的分支定界算法。
Convex Cuts: Tips and techniques for creating sharp, convex details in geometry under subdivision.
凸形切割:在细分下在几何形状中创建尖锐,凸形细节的提示和技术。
To gain sevrial decision method of convex (concave) function by the definition of convex(concave) function and Taylor formula.
利用凸(凹)函数的定义和泰勒公式给出了凸(凹)函数的几个判别法。
应用推荐