首页> 美国卫生研究院文献>Journal of Advanced Research >RF cavity design exploiting a new derivative-free trust region optimization approach
【2h】

RF cavity design exploiting a new derivative-free trust region optimization approach

机译:利用新型无导数信赖域优化方法的射频腔设计

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In this article, a novel derivative-free (DF) surrogate-based trust region optimization approach is proposed. In the proposed approach, quadratic surrogate models are constructed and successively updated. The generated surrogate model is then optimized instead of the underlined objective function over trust regions. Truncated conjugate gradients are employed to find the optimal point within each trust region. The approach constructs the initial quadratic surrogate model using few data points of order O(n), where n is the number of design variables. The proposed approach adopts weighted least squares fitting for updating the surrogate model instead of interpolation which is commonly used in DF optimization. This makes the approach more suitable for stochastic optimization and for functions subject to numerical error. The weights are assigned to give more emphasis to points close to the current center point. The accuracy and efficiency of the proposed approach are demonstrated by applying it to a set of classical bench-mark test problems. It is also employed to find the optimal design of RF cavity linear accelerator with a comparison analysis with a recent optimization technique.
机译:在本文中,提出了一种新的基于无导数(DF)代理的信任区域优化方法。在提出的方法中,构造了二次代理模型并相继更新。然后优化生成的代理模型,而不是对信任区域上带下划线的目标函数进行优化。采用截断的共轭梯度来找到每个信任区域内的最佳点。该方法使用数量为O(n)的几个数据点构造初始二次代理模型,其中n是设计变量的数量。所提出的方法采用加权最小二乘拟合来更新代理模型,而不是通常在DF优化中使用的插值法。这使得该方法更适合于随机优化和易受数值误差影响的函数。分配权重是为了更加强调靠近当前中心点的点。通过将其应用于一组经典基准测试问题,证明了该方法的准确性和效率。通过与最近的优化技术进行对比分析,它还可用于找到RF腔线性加速器的最佳设计。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号