最优化
- 与 最优化 相关的网络例句 [注:此内容来源于网络,仅供参考]
-
The forth part is different to the third one, because the salary is not steady but obeys to a continuous distribution function.
在此,通过对最优化问题的求解,得到了意义更为广泛的工资表达式,并得到工人的平均福利水平。
-
In Chapter 2, we first review the general theory of optimal control.
第三章的内容为最优化相干控制理论。
-
An optimal path planning algorithm of the observer is proposed in this paper, which is based on the dynamic programming. Based on the data measured at the current stage, the optimal moving direction of the observer at the next stage is calculated aiming at the maximum area of the target feasible region convergence.
该算法在当前测量时刻所测数据的基础上,以目标位置可行域收敛面积最大化为目标,分析出观测站运动到下一测量时刻的最优运动方向,从而达到缩短定位时间和抑制定位误差的目的,实现整个测量路线的最优化。
-
With the algorithm analysis of the convex programming model, an optimization solution was achieved by way of illustration and sensitivity analysis of the result was given.
文章分析了模型的求解方法,通过实例的数据计算得到了最优化结果,并对结果进行了敏感性分析。
-
For a finite-security and finite- state financial market with three forms of friction: ask-bid spread, transaction costs and tax, by using the theory of convex analysis and some optimization techniques, a series of necessary and sufficient conditions are established to characterize weak and strong no-arbitrage respectively.
对存在买进卖出价差、交易费和税收三种摩擦和有限个可能的自然状态的金融市场,利用凸分析理论和最优化技术刻划出了强无套利和弱无套利的一系列充要条件,以往许多这方面的结果均是我们的特例。
-
Based on theory of convex cone s,our extensions of robust linear optimization are done in three directions.
本文基于凸锥理论对鲁棒线性最优化作了若干拓展。
-
This article incorporates robustness into a general convex conic optimization problem and shows its deterministic equivalence under the D-duality framework, in which one needs only to compute a D-induced convex cone, which is generally difficult.
本文把不确定性考虑进凸锥最优化问题,在D-对偶理论的框架内把原问题的确定性等价问题表示出来了。对于这样的问题,我们只要计算一个D-对偶锥就可以了。
-
A fast iteration algorithm for one dimensional unconstraint optimization problems of convex functions is suggested.
本文给出一个解凸函数一维无约束最优化问题的快速迭代算法。
-
We also construct an algorithm for minimizing its Moreau-Yosida regularization, because this is a smooth convex optimization problem.
极小化一个凸函数可以采用在UV-空间分解理论基础上提出的概念型超线性收敛算法,也可以采用极小化这一凸函数的Moreau-Yosida正则化函数的算法,因为这是一个凸规划的光滑最优化问题。
-
Convexity and generalized convexity play a central role in mathematical economics, engineering, management science, and optimization theory.
凸性和广义凸性在数理经济、工程、管理科学以及在最优化理论中起着非常重要的作用。
- 推荐网络例句
-
I can not make it blossom and suits me
我不能让树为我开花
-
When temperatures are above approximately 80 °C discolouration of the raceways or rolling elements is a frequent feature.
当温度高于 80 °C 左右时,滚道或滚动元件褪色是很常见的特征。
-
The lawyer's case blew up because he had no proof.
律师的辩护失败,因为他没有证据。