无约束优化用英语怎么说,无约束优化的英文翻译


词语导航

基本信息

词语:无约束优化

繁体:無約束優化

拼音:wú yuē shù yōu huà

英语翻译

【计】 unconstrained optimization
【化】 unconstrained optimization

分词翻译

无的英语翻译:

naught; nonexistence; not; nothing; without; lack; zero
【医】 a-; leipo-; lipo-; non-

约束优化的英语翻译:

【计】 constrained optimization

翻译例句

1. 利用无约束优化方法对该偏差余项进行估计。

An unconstrained optimization algorithms is proposed for the estimation of the bias residue.

2. 采用惩罚函数法将约束优化转化为约束优化

Penalty function method transfer constrained condition into unconstrained condition.

3. 共轭梯度法是求解约束优化问题的一类有效方法。

The conjugate gradient method is one of the most efficient methods for solving unconstrained optimization problems.

4. 研究给出了一类新的求解无约束优化问题的下降算法。

In this paper, a class of new descent algorithm is proposed to solve unconstrained optimization problems.

5. 共轭梯度法是求解大规模约束优化问题的一种有效方法。

Conjugate gradient method is an efficient method in solving problems with unconstrained optimization, which is especially efficient in dealing large dimension.

6. 本文所述的计算程序,适用于一般结构的无约束优化分析。

The computer program proposed is applicable to the optimal analysis of ordinary structures.

7. 提出一种解大规模无约束优化问题的自适应过滤信赖域法。

An adaptive filter trust region method for large scale unconstrained optimization is proposed.

8. BFGS算法是解约束优化问题的公认的最有效的算法之一。

BFGS algorithm is one of the most effective methods in solving the non-constrained optimization problems.

9. 对于一般的无约束优化问题,信赖域方法是一种比较有效的方法。

Trust region method is a kind of efficient and robust method to solve general unconstrained optimization.

10. 本书包括约束优化计算、约束优化计算、动态优化计算三部分。

This book, including unconstrained optimization, the constrained optimization, the dynamic optimization of the calculation of three parts.

11. 采用罚函数将约束优化转化为约束优化,并用单纯形方法求解。

Punishment function is used to transfer the constrained optimization to unconstrained optimization and the Nelder and Mead Method is used to solve this optimization problem.

12. 通过变换可将该无约束优化问题转化为求解非线性代数方程组的问题。

This unconstrained optimization problem may be transformed into nonlinear algebraic system of equations.

13. 该文提出一种无约束优化非线性共轭梯度法,证明了精确线性搜索下的全局收敛性。

The paper presents a nonlinear conjugate gradient method for unconstrained optimization problem, and proves its global convergence under exact line searches.

14. 本文提出一类求解无约束优化问题的非单调曲线搜索方法,在较弱条件下证明了其收敛性。

This paper presents a non-monotone curve search method for unconstrained optimization problems and proves its convergence under some mild conditions.

15. 此软件综合了多种约束优化方法,可以通过为参数设置不同的值来选择不同的解题方法。

The software includes many unconstrained optimization algorithms, we can choose different methods by setting different values for parameters.

16. 然后从信赖域子问题的角度出发,对约束优化问题提出了一个改进的非单调信赖域算法。

We discuss non-monotonic trust region algorithm for unconstrained nonlinear optimization problems in view of Trust Region Model mainly.

17. 根据杆长约束条件,给出了求解3 - R PR平面并联机构位置正解的约束优化模型。

In accordance with the constraint conditions of rod lengths, the optimization model without constraints for solving the positional forward solution of 3-rpr planar parallel mechanism was presented.

18. 以这些空间点为初始值,利用无约束优化,得到在一定值范围内的原方程组的全部精确实数解。

By taking these spatial points as initial guess, all exact real solutions within a certain range of variables are found using unrestraint optimization.

19. 约束优化问题的共轭梯度路径构造的思想启迪我们用其来解带线性等式约束和有界变量约束优化问题。

The idea of conjugate gradient path in unconstrained optimization irradiates us to use this method for solving the linear equality optimization subject to bounds on variables.

20. 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.

21. 由于优化问题可能是不连续的、不可微的甚或是没有函数解析式的,传统经典的无约束优化方法在应用时会受到限制。

Because the optimization problem may be discontinuous and non-differentiable even has no objective function, the traditional optimization methods are unable to tackle with it.

22. 结合评价函数法将带约束的多目标优化问题转化为约束优化问题,并给出相应的区间扩张,对相关定理进行了证明。

The paper, combined with evaluation function introduces the transformation of constrained problems into unconstrained ones, and offers an interval extension.

23. 通过对连续变量无约束优化、连续变量约束优化和离散变量约束优化等典型优化问题的计算分析 ,将三种惩罚函数方法进行了比较 ,指出了它们的特点及选用原则。

The selection of the key parameters and genetic operators is discussed. The calculation results of three computational examples are given. The characteristic of the three methods is pointed.

24. 将微分进化算法的应用范围从求解无约束单目标优化推广到求解一般情形的多目标优化

The application scope of differential evolution algorithm is extended to a general multi-objective optimization from unconstrained single-objective optimization.

25. 针对无约束函数最优化问题,提出了一种能有效加快收敛速度的改进单纯形算法。

An improved simplex method (ISM) based on Nelder and Meads simplex method (N-M SM) is presented for unconstrained function optimization.

26. 用序列约束极小化方法(SUMT)求解非线性有约束优化问题。www.WEnTiyI.Com

The non linear optimization problem with constraint has been solved by use of the sequential unconstrained minimization technique (SUMT).

27. 用序列约束极小化方法(SUMT)求解非线性有约束优化问题。

The non linear optimization problem with constraint has been solved by use of the sequential unconstrained minimization technique (SUMT).

版权声明:问题易所有作品(图文、音视频)均来源网络,版权归原创作者所有,与本站立场无关,如不慎侵犯了你的权益,请联系我们告知,我们将做删除处理!