skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Robust simplex algorithm for online optimization

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.

Authors:
Publication Date:
Research Org.:
SLAC National Accelerator Lab., Menlo Park, CA (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1477568
Alternate Identifier(s):
OSTI ID: 1490382
Report Number(s):
slac-pub-17288
Journal ID: ISSN 2469-9888; PRABCJ; 104601
Grant/Contract Number:  
AC02-76SF00515
Resource Type:
Journal Article: Published Article
Journal Name:
Physical Review Accelerators and Beams
Additional Journal Information:
Journal Name: Physical Review Accelerators and Beams Journal Volume: 21 Journal Issue: 10; Journal ID: ISSN 2469-9888
Publisher:
American Physical Society
Country of Publication:
United States
Language:
English
Subject:
43 PARTICLE ACCELERATORS

Citation Formats

Huang, Xiaobiao. Robust simplex algorithm for online optimization. United States: N. p., 2018. Web. doi:10.1103/PhysRevAccelBeams.21.104601.
Huang, Xiaobiao. Robust simplex algorithm for online optimization. United States. https://doi.org/10.1103/PhysRevAccelBeams.21.104601
Huang, Xiaobiao. 2018. "Robust simplex algorithm for online optimization". United States. https://doi.org/10.1103/PhysRevAccelBeams.21.104601.
@article{osti_1477568,
title = {Robust simplex algorithm for online optimization},
author = {Huang, Xiaobiao},
abstractNote = {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.},
doi = {10.1103/PhysRevAccelBeams.21.104601},
url = {https://www.osti.gov/biblio/1477568}, journal = {Physical Review Accelerators and Beams},
issn = {2469-9888},
number = 10,
volume = 21,
place = {United States},
year = {Wed Oct 03 00:00:00 EDT 2018},
month = {Wed Oct 03 00:00:00 EDT 2018}
}

Journal Article:
Free Publicly Available Full Text
Publisher's Version of Record at https://doi.org/10.1103/PhysRevAccelBeams.21.104601

Citation Metrics:
Cited by: 11 works
Citation information provided by
Web of Science

Figures / Tables:

FIG. 1 FIG. 1: Minimum function values in 1000 evaluations for the Rosenbrock problem in 100 optimization runs (sorted) with the Nelder-Mead simplex algorithm (blue dashed line), Nelder-Mead with N = 3 averaging (red dash-dot line), the robust simplex algorithm without simplex rebuilding (RSim- plex w/o Rebuild, solid yellow line) and withmore » simplex rebuild- ing (RSimplex w/ Rebuild, solid magenta line).« less

Save / Share:

Works referenced in this record:

An Automatic Method for Finding the Greatest or Least Value of a Function
journal, March 1960


Multivariate optimization of a high brightness dc gun photoinjector
journal, March 2005


Multi-objective particle swarm and genetic algorithm for the optimization of the LANSCE linac operation
journal, March 2014


Online optimization of storage ring nonlinear beam dynamics
journal, August 2015


A Simplex Method for Function Minimization
journal, January 1965


Experimental determination of storage ring optics using orbit response measurements
journal, March 1997


Minimization of Betatron Oscillations of Electron Beam Injected Into a Time-Varying Lattice via Extremum Seeking
journal, January 2018


Nelder-Mead Simplex Modifications for Simulation Optimization
journal, July 1996


A Revised Simplex Search Procedure for Stochastic Simulation Response Surface Optimization
journal, November 2000


Machine based optimization using genetic algorithms in a storage ring
journal, February 2014


An algorithm for online optimization of accelerators
journal, October 2013

  • Huang, Xiaobiao; Corbett, Jeff; Safranek, James
  • Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment, Vol. 726
  • https://doi.org/10.1016/j.nima.2013.05.046

Works referencing / citing this record:

Parallel general purpose multiobjective optimization framework with application to electron beam dynamics
journal, May 2019


Figures/Tables have been extracted from DOE-funded journal article accepted manuscripts.