UC知道英文翻译（数学、计算机结合的）
来源：百度知道 编辑：UC知道 时间：2024/06/22 16:32:25
In this paper we develop, analyze, and test a new algorithm for the global minimization of a function subject to simple bounds without the use of derivatives. The underlying algorithm is a pattern search method, more speci cally a coordinate search method, which guarantees convergence to stationary points from arbitrary starting points.
In the optional search phase of pattern search we apply a particle swarm scheme to globally explore the possible nonconvexity of the objective function. Our extensive numerical experiments showed that the resulting algorithm is highly competitive with other global optimization methods also based on function values.
还有就是derivative free optimization， bound constrained nonlinear optimization.都怎么翻译，谢谢~~~
In the optional search phase of pattern search we apply a particle swarm scheme to globally explore the possible nonconvexity of the objective function. Our extensive numerical experiments showed that the resulting algorithm is highly competitive with other global optimization methods also based on function values.
还有就是derivative free optimization， bound constrained nonlinear optimization.都怎么翻译，谢谢~~~
在这纸中我们没有派生物的使用发展,分析,和检测一新算法的一个跳跃取决于简单功能的全球性减少到最低限度.隐藏着的算法是模范大海
衍生物释放优化。跳起拘束的非线性优化
在我们开发的本文里, 分析, 和测试一种新算法对于作用的全球性低估依于简单的区域没有对衍生物的用途。部下的算法cally 是样式查寻方法, 更多speci 一个同等的查寻方法, 保证汇合对固定式点从任意起点。 在任意查寻阶段样式查寻我们运用一份微粒群计划全球性地探索目标函数的可能的nonconvexity 。我们广泛的数字实验表示, 收效的算法是高度竞争的以其它全球性优化方法并且根据作用价值
----------------
下面几个是
衍生物释放优化 区域拘束的非线性优化