基元抽取问题可以归结为优化问题，即寻找代价函数的全局最小值。
This program can be treated as an optimum program, that is to find the optimum value of a cost function.
许多情况下，该电路可以避免一些局部最小值，而找到一个全局最小值。
In most cases, these circuit structures may avoid some local minima and find a global minimum.
但是由于这些方法不考虑复杂度的控制以及不能保证全局最小值，所以它们的性能不稳定。
However, since these approaches take no account of complexity control and have no guarantee of global minimum, they often suffer from unstable performance.
应用推荐