采用迭代法求解该优化方程来逼近运动轨迹任意处伪活动标架的旋转变换矩阵。
An iteration method is presented to solve the optimization function for approximating the rotation transformation part of the pseudo moving frame at any position of the motion trajectory.
并提出分别采用共轭梯度法、二元自适应收缩法以及梯度下降法对以上优化问题求解。
And the three optimization problems are solved respectively by the conjugate gradient method, the adaptive bivariate shrinking and the gradient descent method.
方法引入了金属铣削加工参数多目标优化模型，应用目标达到法对模型求解，又基于神经网络建立了金属铣削参数自动获取模型。
It introduces the multi-objected optimization model of the metal milling process parameters and applies the goal attainment method to ask for the explanation for the model.
然后采用最佳矢量法求解结构体系可靠度指标约束下的最小重量优化设计问题。
Secondly, the problem of the minimum weight design is resolved by using the optimum vector algorithm under the constraint of the structure system reliability.
提出了一种用于对称区间矩阵特征值问题求解的直接优化法。
A direct optimization method is presented in the paper for solving eigen problems of interval matrices.
介绍一种采用最优化方法—黄金分割法（0．618法）求解传感器最佳拟合直线的新方法。
This paper gives a new method evaluting the optimum fitting straight of sensors-the golden cut method(0.618 method).
协同利用数学变换、高精度近似和二级逼近策略，提出了一种求解结构优化问题的准解析法。
A quasi analytic method for solving structural optimization problems is developed by coordinated use of mathematical transformations, high quality approximation and two level approximation strategy.
TS算法属于现代优化算法，是局部领域搜索法的推广，常用于求解组合优化问题。
The tabu search (TS) method is one of the modern optimization algorithms developed from local search. It is generally used in combinatorial optimization problem.
将基于直接搜索法的随机全局优化方法用于求解该问题的全局最优解，给出了具体的算法步骤。
A stochastic global optimization method based on direct search is introduced to solve the global optimal solution of the problem, and the process is also discussed in detail.
再次由德尔菲法和二次比选模型对模型求解结果分别进行初次和二次评估修正，从而得到进一步优化的配送网络；
Thirdly, the aticle evaluates and revises the results calculated from the foregoing madel with Delphi method and secondary comparative model, thus gets ulteriorly optimized distribution network.
建立了在线切割系统中用尽可能少的圆弧近似代替非圆曲线的优化模型，采用二分法进行求解。
The optimization model of which arc approximately substitute non-circular cure is established in this paper, and result is get by the method of dichotomy.
采用最小参数法求解四元数微分方程，优化了四元数实时更新算法。
When optimizing synchro update of the quaternion, the quaternion differential equation is calculated by using minimum parametric method.
基于多目标优化理论，建立了养护机械优化配置模型，并给出一种求解方法——逐步宽容约束法。
Using the theory of multiple objective optimization, the paper sets up the model of optimal allocation for maintenance machinery; and presents the practicable methods and procedures for the model.
该法先将实因式分解问题转化为数值优化问题，再用基于混合杂交与间歇变异的演化算法求解该优化问题。
The proposed method transfers the real factorization problem into a numeric optimization problem, which is solved by an evolutionary algorithm based on hybrid crossovers and intermittent mutation.
有鉴于此，以随机模拟法为基础，建立了求解防洪发电相结合的水库群防洪库容优化模型。
To solve the problems, this paper develops an optimum model based on random simulation method for solving volume of reservoir group flood control.
文中提出用高斯列主元消去法与最优化方法相结合的技术求解模拟电荷方程组，是提高精度和保证收敛的一种有效算法。
The combined method of gnass elimination and optimization is used to solve the equation of charge-simulation, and it is an effective method for increasing the accuracy and assuring the convergence.
PR共轭梯度法是求解大型无约束优化问题的有效算法之一，但是算法的全局收敛性在理论上一直没有得到解决。
Pr conjugate gradient method is one of the efficient methods for solving large scale unconstrained optimization problems, however, its global convergence has not been solved for a long time.
最小能量的优化求解用迭代条件模式(ICM)方法，初始分割标记场用矢量直方图法得到。
The optimization of solution is carried out by Iterated Conditional Mode (ICM) method. The initial segmentation label fields is gotten using vector histogram.
共轭梯度法是求解最优化问题的一类有效算法。
Conjugate gradient methods are important iterative methods for solving optimization problems.
对索膜结构找力分析的优化复位平衡法，能够对给定的拓扑曲面求解获得精确的自平衡预应力分布。
The optimized reposition balance method for force-finding analysis usually is employed to accurately evaluate the self-balance prestress of tensility structures.
然后采用优化法编程求解并分析计算，这种直接搜索优化方法稳定性好，编程简单。
The optimization method is used to solve the equation and is analyzed, which is more stabilized and simpler.
本文提出一种求解优化数学模型，属于非线性整数规划问题的方法——逐次近似法。
In this paper, an optimal mathematical model solving method, the successive approximation method, of the nature of nonlinear integral programming problem is suggested.
共轭梯度法是求解无约束优化问题的一类有效方法。
The conjugate gradient method is one of the most efficient methods for solving unconstrained optimization problems.
该方法利用最大似然准则建立目标函数，同时利用非线性共轭梯度法来优化求解目标函数。
The objective function was established based on the maximum likelihood rule, which was solved by nonlinear conjugate gradient method.
极大极小问题是一类不可微优化问题，熵函数法是求解这类问题的一种有效算法。
Minimax problem is a sort of non-differentiable optimization problem and the entropy function method provides a efficient approach to solve such kind of problems.
结果表明：SUMT法收敛快、精度高，是求解机械优化设计问题的高效算法。
The studies show that SUMT is practicable and reliable in machine optimal design.
文章基于蚁群思想，提出了一种融合网格法的蚁群算法来求解柔性制造系统工艺路线优化配置的方法。
In this paper, a kind of ant colony algorithm which is combined with the gridding method is introduced to achieve optimal assignment of the process routes of the FMS.
可行方向法（简称为MFD）是用于求解非线性约束最优化重要的方法之一。
The method of feasible directions (MFD for short) is an important method for solving nonlin-early constrained optimization.
针对这一优化问题，通过引入非线性互补问题函数，将原优化问题转化为非线性方程组，并采用半光滑牛顿法进行求解。
By introducing nonlinear complementarity problem function, the original optimization problem is transferred equivalently to a set of nonlinear equations and solved by semi-smooth Newton method.
对于连续优化问题，提出了基于蚁群算法思想的求解算法，并与网格法作了比较。
Based on the ant colony optimization idea, a new algorithm for continuous optimization problem is presented.
应用推荐