Robust simplex algorithm for online optimization
Open Access
- 3 October 2018
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Accelerators and Beams
- Vol. 21 (10) , 104601
Abstract
A new optimization algorithm is introduced for online optimization applications. The algorithm was modified from the popular Nelder-Mead simplex method to make it noise aware and noise resistant. Simulation with an analytic function is used to demonstrate its performance. The algorithm has been successfully tested in experiments, which showed that the algorithm is robust for optimization problems with complex functional dependence, high cross-coupling between parameters, and high noise. Advantages of the new algorithm include high efficiency and that it does not require prior knowledge of the parameter space such as an initial conjugate direction set.Keywords
Funding Information
- U.S. Department of Energy (DE-AC02-76SF00515)
- Office of Science
- Basic Energy Sciences
This publication has 14 references indexed in Scilit:
- Feasibility study of online tuning of the luminosity in a circular collider with the robust conjugate direction search methodChinese Physics C, 2015
- Online optimization of storage ring nonlinear beam dynamicsPhysical Review Special Topics - Accelerators and Beams, 2015
- An algorithm for online optimization of acceleratorsNuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment, 2013
- Stochastic Nelder–Mead simplex method – A new globally convergent direct search method for simulation optimizationEuropean Journal of Operational Research, 2012
- Multivariate optimization of a high brightness dc gun photoinjectorPhysical Review Special Topics - Accelerators and Beams, 2005
- A Revised Simplex Search Procedure for Stochastic Simulation Response Surface OptimizationINFORMS Journal on Computing, 2000
- Nelder-Mead Simplex Modifications for Simulation OptimizationManagement Science, 1996
- A Simplex Method for Function MinimizationThe Computer Journal, 1965
- An efficient method for finding the minimum of a function of several variables without calculating derivativesThe Computer Journal, 1964
- An Automatic Method for Finding the Greatest or Least Value of a FunctionThe Computer Journal, 1960