Cargando…

Using neural networks to speed up optimization algorithms

The paper presents the application of radial-basis-function (RBF) neural networks to speed up deterministic search algorithms used for the design and optimization of superconducting LHC magnets. The optimization of the iron yoke of the main dipoles requires a number of numerical field computations p...

Descripción completa

Detalles Bibliográficos
Autores principales: Bazan, M, Russenschuck, Stephan
Lenguaje:eng
Publicado: 2000
Materias:
Acceso en línea:https://dx.doi.org/10.1051/epjap:2000177
http://cds.cern.ch/record/502990
_version_ 1780897282844000256
author Bazan, M
Russenschuck, Stephan
author_facet Bazan, M
Russenschuck, Stephan
author_sort Bazan, M
collection CERN
description The paper presents the application of radial-basis-function (RBF) neural networks to speed up deterministic search algorithms used for the design and optimization of superconducting LHC magnets. The optimization of the iron yoke of the main dipoles requires a number of numerical field computations per trial solution as the field quality depends on the excitation of the magnets. This results in computation times of about 30 minutes for each objective function evaluation (on a DEC-Alpha 600/333) and only the most robust (deterministic) optimization algorithms can be applied. Using a RBF function approximator, the achieved speed-up of the search algorithm is in the order of 25% for problems with two parameters and about 18% for problems with three and five design variables. (13 refs).
id cern-502990
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 2000
record_format invenio
spelling cern-5029902019-09-30T06:29:59Zdoi:10.1051/epjap:2000177http://cds.cern.ch/record/502990engBazan, MRussenschuck, StephanUsing neural networks to speed up optimization algorithmsAccelerators and Storage RingsThe paper presents the application of radial-basis-function (RBF) neural networks to speed up deterministic search algorithms used for the design and optimization of superconducting LHC magnets. The optimization of the iron yoke of the main dipoles requires a number of numerical field computations per trial solution as the field quality depends on the excitation of the magnets. This results in computation times of about 30 minutes for each objective function evaluation (on a DEC-Alpha 600/333) and only the most robust (deterministic) optimization algorithms can be applied. Using a RBF function approximator, the achieved speed-up of the search algorithm is in the order of 25% for problems with two parameters and about 18% for problems with three and five design variables. (13 refs).oai:cds.cern.ch:5029902000
spellingShingle Accelerators and Storage Rings
Bazan, M
Russenschuck, Stephan
Using neural networks to speed up optimization algorithms
title Using neural networks to speed up optimization algorithms
title_full Using neural networks to speed up optimization algorithms
title_fullStr Using neural networks to speed up optimization algorithms
title_full_unstemmed Using neural networks to speed up optimization algorithms
title_short Using neural networks to speed up optimization algorithms
title_sort using neural networks to speed up optimization algorithms
topic Accelerators and Storage Rings
url https://dx.doi.org/10.1051/epjap:2000177
http://cds.cern.ch/record/502990
work_keys_str_mv AT bazanm usingneuralnetworkstospeedupoptimizationalgorithms
AT russenschuckstephan usingneuralnetworkstospeedupoptimizationalgorithms