...
首页> 外文期刊>International Journal of Statistics and Probability >Comparative Study of the Quick Convergent Inflow Algorithm (QCIA) and the Modified Quick Convergent Inflow Algorithm (MQCIA)
【24h】

Comparative Study of the Quick Convergent Inflow Algorithm (QCIA) and the Modified Quick Convergent Inflow Algorithm (MQCIA)

机译:快速收敛流入算法(QCIA)和改进的快速收敛流入算法的比较研究(MQCIA)

获取原文
           

摘要

The performance of two line search algorithms, the Quick Convergent Inflow Algorithm and the Modified Quick Convergent Inflow Algorithm, used in locating the optimizers of response functions is studied. The methodology requires the use of the same starting experimental design. The indicator variables are the number of iterations and the optimal point reached at each iteration. The Modified Quick Convergent Inflow Algorithm seems to perform generally better than the Quick Convergent Inflow Algorithm in the sense that solutions obtained are much closer to the exact solutions than those obtained using the Quick Convergent Inflow Algorithm. As a consequence to the study, a new algorithm is developed for solving Linear Programming problems. The algorithm iteratively eliminates from an N-sized starting design a point that contributes less to the process as measured by the predictive variances at the design points. The design size is immediately recoverd by adding to the resulting N-1 sized design a design point from the candidate set that optimizes performance. The new algorithm offers approximate solutions to Linear Programming problems as demonstrated with some numerical illustrations.
机译:研究了两个线路搜索算法,快速收敛流入算法和改进的快速收敛流入算法,用于定位响应函数的优化器。该方法需要使用相同的起始实验设计。指示器变量是迭代的数量,并且在每次迭代时达到的最佳点。修改的快速收敛流入算法通常比快速收敛流入算法更好地表现得比使用快速收敛流入算法获得的精确解决方案更接近精确的解决方案。因此,开发了一种新的算法来解决线性规划问题。该算法迭代地从N大小的起始设计中消除了一种点,该点略致力于通过设计点的预测方差测量的过程。通过添加到优化性能的候选集的设计点,可以立即恢复设计大小。新算法为线性编程问题提供了近似解决方案,如有一些数字插图所示。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号