科研之友
微信
新浪微博
Facebook
分享链接
摘要
The conical algorithm is a global optimization algorithm proposed by Tuy in 1964 to solve concave minimization problems. Introducing the concept of pseudo-nonsingularity, we give an alternative proof of convergence of the algorithm with the -subdivision rule. We also develop a new convergent subdivision rule, named -bisection, and report numerical results of comparing it with the usual omega-subdivision.
- 出版日期2015-2
