| 1. | The shortest path analysis based on genetic algorithms
迭代的半局部收敛性分析 |
| 2. | Semilocal convergence of newton method for complementarity problems
方法的半局部收敛性 |
| 3. | On local convergence of
迭代的局部收敛性 |
| 4. | The local and semilocal convergence theorems about the method are also given
1 . 3 ) ) ，并给出它的局部收敛性和半局部收敛性定理 |
| 5. | However , conventional solution methods such as newton iterative method , quasi - newton iterative method are initialization dependent and maybe could not reliable converge
传统的求解方法如牛顿迭代法和拟牛顿迭代法都是典型的局部收敛性方法。 |
| 6. | The experimental results indicate that it is a feasible method , which is easy and adaptable to the evaluation of the performance of genetic algorithms
同时，为了克服普通遗传算法近亲繁殖、局部收敛的缺陷，本文在遗传算法的实现过程中应用了小生境技术。 |
| 7. | Because of ga ' s advantage of globally searching , it can avoid ann ' s problem of local convergence . thus the advantages of both ga and ann are brought into play completely
遗传算法有全局搜索的特点，可以避免神经网络局部收敛的问题，充分发挥遗传算法和神经网络各自的优势。 |
| 8. | And then , the eight - parameter 2d projection model is optimized by ga , including adjusting genetic operators to eliminate the local convergence and premature convergence problem
接着本文采用遗传算法优化二维投影模型的8个参数，通过调整遗传算子来消除局部收敛和末成熟收敛问题。 |
| 9. | By giving some properties of the double dogleg path , we prove the global convergence and fast local convergence rate of the proposed algorithm under some reasonable conditions
通过给出双折线路径的一些性质，在合理的条件下，我们证明了所提供算法具有整体收敛性并得到局部收敛速率。 |
| 10. | The local convergence theorem is important because it shows the property of the iterative method near the solution , but the shortcoming is that its codition depends on the unknown solution
局部收敛性定理固然很重要，因为它不仅提供了一个关于收敛性的结果，而且还表征着某些迭代过程在一个解的邻域内的理论性态。 |
