布局问题是一个组合最优化问题。
这种最优化问题和其他最优化问题的解可能不止一个。
This and the other optimization problems you'll look at might have more than one solution.
共轭梯度法是求解最优化问题的一类有效算法。
Conjugate gradient methods are important iterative methods for solving optimization problems.
信赖域方法是研究最优化问题的有效方法之一。
The trust region method is one of the most valid ways to study optimization problems.
信赖域算法是求解最优化问题的一类有效算法。
Trust region methods are efficient for solving unconstraint optimization problems.
其中引入了线性数学规划方法求解最优化问题。
The optimization problem is solved by linear programming technique.
考虑时变系统辨识中辨识设计变量的最优化问题。
In this article the optimization problem of time varying system identification is discussed.
本文提出一类新的解无约束最优化问题的信赖域方法。
In this paper, we propose a new class of trust region methods for nonlinear optimization problems.
第二部分主要研究无约束最优化问题非单调信赖域法。
At the second part, nonmonotonic trust region method for unconstrained optimization is studied.
将电力电子系统的最优控制问题变换为参数最优化问题。
The optimal control problem of a power electronic system is transformed into a parameter optimization problem.
一旦电脑具备了语义功能，它们就有能力解决复杂的语义最优化问题。
Once computers are equipped with semantics, they will be capable of solving complex semantical optimization problems.
对求解无约束最优化问题，本文给出了一个区间压缩方法。
In this paper, the method of region constriction for global optimization is proposed.
该方法将模型修正问题转化为一个带二次约束的最优化问题。
The updating problems of structure models are turned into the optimization with a quadratic constraint.
由于工程最优化问题的复杂性，传统的最优化方法一般很难求解。
Because of the complexity of the project optimization problem, the traditional optimization method can hardly be used to solve.
本文在局部凸空间中对集值映射最优化问题引入超有效解的概念。
In this paper, we introduce a concept of super efficient solution of the optimization problem for a set-valued mapping.
单调优化是指目标函数与约束函数均为单调函数的全局最优化问题。
The monotone optimization is to maximize or minimize a monotone objective function constrained by monotone functions.
在给定了一族参数的多目标最优化问题中，灵敏度分析是定量的分析。
In the problems of a given family of parametrized multiobjective optimization, sensitivity analysis is the quantitative analysis.
信息系统决策支持的关键是要解决管理过程的数学描述和最优化问题。
It is the key of decision support in information system to make management process described in math and optimized.
数学上通过能量度量最小化把这些问题转化成变量或函数的最优化问题。
The minimization of some energy measure translates some problems into an optimization problem depending on the unknown variables (which are function) in mathematics.
依据最优化问题理论和网格法思想，提出解最优化问题的实用二分算法。
According to the theory of optimization problem and the idea of network method, the Practical Bisection Algorithm of solving optimization problem is presented.
对量子状态层析的实验设计进行总结，并着重分析了测量次数最优化问题。
Summarize how to design quantum state tomography, and analyze how to optimize The Times of different measurements.
通过对这两类问题的讨论，提出并论述了矿井通风系统的模糊最优化问题。
Through the discussion of the two categories, the paper puts forward and expounds the fuzzy optimization of mine ventilation system.
图像匹配是一种约束最优化问题，系统是否收敛于全局最优值一直尚未解决。
Image matching belongs to constrained optimization problems. Whether the system would converge to the global optimum is still an open problem.
线性搜索方法和信赖域方法是保证最优化问题的整体收敛性的两种基本策略。
Both line search and trust region algorithm are well-accepted methods in the optimization to assure global convergence.
本文针对数据聚类分析和最优化问题的相似点，用模拟退火算法进行聚类分析。
In view of the similarities between data clustering analysis and optimization questions, this paper deals with data clustering analysis by using simulation anneal algorithms.
现在，当我们讨论，动态编程中的最优化问题时，我想说有两件事需要注意。
Now, when we talked about optimization problems in dynamic programming, I said there were two things to look for.
针对无约束函数最优化问题，提出了一种能有效加快收敛速度的改进单纯形算法。
An improved simplex method (ISM) based on Nelder and Meads simplex method (N-M SM) is presented for unconstrained function optimization.
但是动态编程通常被用于最优化问题(比如本文后面的示例)，而不是像斐波纳契数这样的问题。
But dynamic programming is usually applied to optimization problems like the rest of this article's examples, rather than to problems like the Fibonacci problem.
阐述最优化问题。在对设计空间进行一些初始抽样后，选择并应用一种合适的最优化技术。
Formulate the optimization problem. Select and apply an appropriate optimization technique after some initial sampling of the design space.
随后又从中央计划者角度求解一个动态最优化问题，发现社会最优和竞争性均衡是一致的。
Solving a dynamic programming problem of a central planner can prove that the competitive equilibrium and the social optimum is identical.
应用推荐