Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. For technical support, please contact us at onlinesupport@ieee.org. We apologize for any inconvenience.
By Topic

An improved method using radial basis function neural networks to speed up optimization algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bazan, M. ; Inst. of Comput. Sci., Wroclaw Univ., Poland ; Aleksa, M. ; Russenschuck, S.

The paper presents a method using radial basis function (RBF) neural networks to speed up deterministic search algorithms used for the optimization of superconducting magnets for the LHC accelerator project at CERN. The optimization of the iron yoke of the main LHC dipoles requires a number of numerical field computations per trial solution as the field quality depends on the excitation and local iron saturation in the yoke. This results in computation times of about 30 min for each objective function evaluation (on DEC-Alpha 600/333). In this paper, we present a method for constructing an RBF neural network for a local approximation of the objective function. The computational time required for such a construction is negligible compared to the deterministic function evaluation, and, thus, yields a speed-up of the overall search process. The effectiveness of this method is demonstrated by means of two- and three-parametric optimization examples. The achieved speed-up of the search routine is up to 30%

Published in:

Magnetics, IEEE Transactions on  (Volume:38 ,  Issue: 2 )