查询词典 optimization problem

In thesis, the generalized symmetric eigenvalue problem can be recasted into an unconstrained optimization problem.

本文先对广义特征分解问题进行建模，将瑞利商优化问题转化为无约束优化问题。

It transforms the primal problem into an ordinary optimization problem with an explicit dual function and simple constraints, with smaller size than primal constraints. It is convenient for engineering application.

该方法不仅给出了原问题显式形式的对偶函数，而且对偶变量的数目仅等于原问题部分约束的个数，原来的线性0-1规划问题被转化为只有简单约束的普通优化问题，极大地方便了工程应用。

Thus, the -general structure topology optimization problem can be regarded as a material interface tracing problem.

其次在结构拓扑优化中还引入了黎曼测度下的平均曲率流正则化技术，以保证计算结果材料界面的光顺性，并有助于提高拓扑演化过程中的数值稳定性。

The graph coloring problem is a widely studied combinatorial optimization problem.

图的着色问题是一个被广泛研究的组合优化问题。

Distribution network reconfiguration problem is a large, mixed integer, nonlinear optimization problem.

配电网络重构问题是一个大规模、混合整形、非线性组合优化问题。

We considered an integer one-dimensional optimization problem appeared in Newton-PCG method. The efficiency of Newton-PCG algorithm is depended on the optimal value of this problem.

目前，对支持向量机的研究主要是针对统计学习理论以及各种应用领域的研究，而从最优化理论的角度出发的研究工作甚少。

The optimization problem was formulated as a multiple-stage optimal control problem and solved by a forward and backward iteration loop.

整个最优化问题被描述成一个多阶段系统优化控制问题，通过一个向前和向后的迭代循环解决。

The knap problem is a classical combinatorial optimization problem which plays an important role in a network source assignment.

背包问题是一类经典的组合优化问题，在网络资源分配中有着广泛的运用。

Through this model, which could make full use of the given prior information as the constraints of maximum likelihood estimation and based on Lagrange function, the calculation problem of fault prior probabilities was transformed to non-constrained optimization problem.

该模型以相关的先验信息作为最大概率估计的约束条件，并通过拉格朗日函数，将故障先验概率估算问题转化成无约束优化问题。

In this paper, we start with a new formulation which is proposed based on the K-SVCR method. We then transform it as a complementarity problem and further a strongly convex unconstrained optimization problem by using the implicit Lagrangian function.

在本文中，我们首先在K-SVCR方法的基础上提出了新的模型，然后把新模型转化成一个互补问题，并利用Lagrangian隐函数进一步转化成一个强凸的无约束优化问题。

We have no common name for a mime of Sophron or Xenarchus and a Socratic Conversation; and we should still be without one even if the imitation in the two instances were in trimeters or elegiacs or some other kind of verse--though it is the way with people to tack on 'poet' to the name of a metre, and talk of elegiac-poets and epic-poets, thinking that they call them poets not by reason of the imitative nature of their work, but indiscriminately by reason of the metre they write in.

索夫农 、森那库斯和苏格拉底式的对话采用的模仿没有一个公共的名称；三音步诗、挽歌体或其他类型的诗的模仿也没有——人们把&诗人&这一名词和格律名称结合到一起，称之为挽歌体诗人或者史诗诗人，他们被称为诗人，似乎只是因为遵守格律写作，而非他们作品的模仿本质。

The relationship between communicative competence and grammar teaching should be that of the ends and the means.

交际能力和语法的关系应该是目标与途径的关系。