• For boxing constraint of control, trigonometric function transformation was developed to achieve an unconstrained problem.

    对于控制变量受约束问题,采用三角函数转换将其转化为控制约束问题。

    youdao

  • Moreover, we get the relationship between the K-T point of the primal problem and the stationary point of the unconstrained problem.

    并且建立问题K-T等价无约束问题稳定之间的关系。

    youdao

  • The basic problem here is that everyone forgot that an unconstrained system has flexible modes AND the rigid body modes.

    这里根本问题人人都忘记一个无约束系统具有弹性体以及刚体模态。

    youdao

  • A new ACO algorithm for unconstrained nonlinear integer optimization problem is present.

    提出了一种新的蚁群算法来求解约束整数规划问题

    youdao

  • The filled function method is an approach for solving unconstrained global minimization problem.

    填充函数无约束全局极小化问题的方法。

    youdao

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

    序列约束极小化方法SUMT求解非线性有约束优化问题

    youdao

  • Nondifferentiable exact penalty functions are used to transform a constrained optimization problem into a single unconstrained optimization problem.

    借助不可微精确函数约束问题转化为单个约束问题来处理。

    youdao

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

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

    youdao

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

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

    youdao

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

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

    youdao

  • The segmentation of unconstrained handwritten Chinese words is the key problem of handwritten Chinese words recognition. It is also the difficulty of current segmentation-recognition truss.

    限定手写汉字分割问题手写汉字识别关键问题,也是目前的分割-识别框架中的难点

    youdao

  • In this paper, a new dynamic programming algorithm for unconstrained 2D stuck cutting problem is presented.

    本文给出了求解无限制板材下问题的动态规划解法,对该算法的计算复杂度进行了分析。

    youdao

  • In this paper, a new dynamic programming algorithm for unconstrained 2D stuck cutting problem is presented.

    本文给出了求解无限制板材下问题的动态规划解法,对该算法的计算复杂度进行了分析。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定