| 1. | An engineering example indicates that it does n ' t demand initial solution , its quality and efficiency are batter than complex algorithm
计算实例表明dmga无需设计初始点，所得解的质量和计算效率均优于复形法。 |
| 2. | This thesis considers the systems of nonlinear inequalities . and several new algorithms which the initial points are arbitrary are presented
本学位论文讨论非线性不等式组，建立了初始点任意的几个新的非线性不等式组算法。 |
| 3. | Without the strict feasibility of the initial points and iteration points , the algorithm is shown to possess both polynomial - time complexity and q - linear convergence
该算法不要求初始点及迭代点的可行性且具有q -线性收敛速度和多项式时间复杂性。 |
| 4. | The advantage of genetic algorithms lies in : to search the best solution for many initial points ; and find the total optimum solution by means of crossover and mutation operator
它从多个初始点开始寻优，借助交叉和变异算子来获得参数的全局最优解。 |
| 5. | Comparing with conventional arithmetic , the arithmetic in this paper has the excellence including fast convergence speed , alterable precision , and random initial value
与传统的计算方法相比，该算法不仅具有收敛速度快，而且计算精度可控以及初始点随机给定集中优点。 |
| 6. | With monte - carlo method , various eroded safe basins of the system are observed , then the reasonable initial value is picked up for the subsequent dynamic analysis
利用蒙特卡罗方法，通过对系统受侵蚀安全盆的变化状况进行了观察，并由此对后继动力学分析的初始点进行了选取。 |
| 7. | The simulation results show that the arithmetic can always converge to its real root for the random initial value , and that its precision is alterable , therefore the arithmetic is valid
计算机仿真结果表明：对于随机给定的初始点，该算法都能稳定收敛到它的一个实根，而且计算精度可控，因此，该算法是有效的。 |
| 8. | In order to overcome the deficiency that initial points should be strictly feasible in interior point methods , a primal - dual infeasible - interior - point algorithm for the second - order cone programming ( socp ) is presented
摘要为了克服内点算法中初始点是严格可行的这一缺点，给出二次锥规划的一种原对偶不可行内点算法。 |
| 9. | All the numerical simulations show that our algorithm is predominant on iterative times over other algorithms . moreover , our algorithm represent well adaptive capacity on the change of starting point and increase of dimensions
所做的数值模拟都表明，我们的算法在迭代次数上具有明显的优势，而且，我们的算法对于初始点的变化以及问题维数的增加显示了很强的适应能力。 |
| 10. | After the discretionary initial point being selected , according to its position , the other two points are adjusted properly so that the three points can show the characteristics of a circle as far as possible , thereby the characteristic parameters of the circle are obtained
讨论了在选取任意初始点后，根据初始点的坐标，适当调整其馀两个点的位置，以使这三点尽量反映圆的特徵，从而精确获得圆的特徵参数。 |
