查询词典 optimization problem

In this paper,a probability space is introduced to describe IC yield optimization problem,and the probability measure of the feasible region is employed to indicate the yield The weighted Monte Carlo method is snitable in the early optimizzation stage,while the improved SA algorithm is more efficient in the final stage.

本文引入了一个概率空间来描述集成电路合格率优化问题，并将合格率表示为可行域的概率测度。所提出的变权重MonteCarlo法适合于合格率不太高的场合，而改进后的SA算法则适合于合格率比较高的场合。

In Chapter 5, the authors study the convergence properties of the gradient projection method for the constrained optimization problem. In this chapter, a new step-size rule, which avoids fulfiling the classical line search and includes choosing a constant as the step size as a special case, is presented and analyzed.

第五章研究了求解约束最优化问题的梯度投影方法，在步长的选取时采用了一种新的策略，这种策略不需要进行传统的线搜索且包含步长取常数这种特例，在较弱的条件下，证明了梯度投影方法的全局收敛性。

The method can solve the equilibrium optimization problem and the results are more proximate to the practical situation.

解决了生产调度均衡优化问题，使得生产调度的优化结果更为贴近实际。

In the third chapter, we concerned PVT algorithms for bound constrained optimization problem and proposed two feasible PVT algorithms.

第三章，我们对含边界约束的PVT算法进行了研究，给出了求解边界约束优化问题的PVT可行算法。

Moreover, it includes the network of quadratic optimization problem.

数值模拟表明网络不仅可行而且有效。

The main goal of this dissertation is to develop and analyze interior-point algorithms and their variants for solving semi-definite, quadratic, combinatorial and nonlinear optimization problem that arise in production management, resource allocation, communication networks and computer science.

本文主要讨论和分析了内点算法的基本理论和基本思想，并将其推广来求解一般的半正定规划、二次规划、组合优化以及非线性规划问题，这些问题在工业生产管理、资源分配、网络通讯和计算机技术等领域中是会经常碰到的。

According to disadvantage of AS that the speed low of convergentiss and easily entering the stagnation,improving the AS in some aspect by the way that importing pheromone windows that the value of pheromone cannot exceed the window,only deposit the pheromone on the edge that belongs to the iteration shortest solution path,releasing additional pheromone to the edge belongs to the so-far shortest solution path,judging the situation of convergent and to reinitialize pheromone,optimizing the solutions by local search procedure at the end of every iteration,modifying the transition probability by add some problem specific parameters and so on.

本文主要运用蚁群优化算法(Ant Colony Optimization，ACO)来求解VRP。针对蚁群算法收敛性比较差，易于停滞的缺陷，通过使用信息素窗口限制、信息素的最大最小值，只更新信息素迭代中最好解，增加了精英的蚂蚁，信息素重新初始化之前先判断出汇聚情况，在每次迭代过程中加入局部的搜索进行优化，在对蚁群算法进行了优化时考虑选择概率当中加入与问题的相关参数等措施，从而使蚁群算法的收敛性得到大大提高，避免了算法的停滞现象。

The objective function of the optimization problem consists of both the performance metrics of the image fusion, such as the root mean square error, and those of individual filters.

该优化问题的目标函数包括了图像融合的性能指标，如最小均方误差以及一些与传统滤波器相关的性能指标，包括阻带和通带能量。

The optimization problem is solved with the sequential linear programming algorithm.

优化问题求解采用序列线性规划算法。

The nonlinear optimization problem is solved with a sequential quadratic programming algorithm.

通过计算和分析优化结果，得出最佳控制参数，为今后自动变速的开发提

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。