4.5 Article

PSwarm: a hybrid solver for linearly constrained global derivative-free optimization

期刊

OPTIMIZATION METHODS & SOFTWARE
卷 24, 期 4-5, 页码 669-685

出版社

TAYLOR & FRANCIS LTD
DOI: 10.1080/10556780902909948

关键词

direct search; linear constraints; pattern search; particle swarm; derivative-free optimization; global optimization

资金

  1. Algoritmi Research Center
  2. FCT [POCI/MAT/59442/2004, POCI/MAT/58957/2004, PTDC/MAT/64838/2006]

向作者/读者索取更多资源

PSwarm was developed originally for the global optimization of functions without derivatives and where the variables are within upper and lower bounds. The underlying algorithm used is a pattern search method, or more specifically, a coordinate search method, which guarantees convergence to stationary points from arbitrary starting points. In the (optional) search step of coordinate search, the algorithm incorporates a particle swarm scheme for dissemination of points in the feasible region, equipping the overall method with the capability of finding a global minimizer. Our extensive numerical experiments showed that the resulting algorithm is highly competitive with other global optimization methods based only on function values. PSwarm is extended in this paper to handle general linear constraints. The poll step now incorporates positive generators for the tangent cone of the approximated active constraints, including a provision for the degenerate case. The search step has also been adapted accordingly. In particular, the initial population for particle swarm used in the search step is computed by first inscribing an ellipsoid of maximum volume to the feasible set. We have again compared PSwarm with other solvers (including some designed for global optimization) and the results confirm its competitiveness in terms of efficiency and robustness.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据