2018
DOI: 10.1103/physrevaccelbeams.21.104601
|View full text |Cite
|
Sign up to set email alerts
|

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 a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
16
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 26 publications
(16 citation statements)
references
References 14 publications
0
16
0
Order By: Relevance
“…When used in an environment where the errors in those cost function values are large enough to cause mistakes in these comparisons, however, this algorithm is vulnerable to performing shrink operations prematurely, which slows the optimization down and may lead to a false appearance of convergence [46]. Due to this difficulty, one would expect the number of iterations required to converge with Nelder-Mead to be especially bad in limited precision environments, though we note that there are a number of modifications that attempt to improve the method's robustness to noise [46,47].…”
Section: Nelder-meadmentioning
confidence: 99%
“…When used in an environment where the errors in those cost function values are large enough to cause mistakes in these comparisons, however, this algorithm is vulnerable to performing shrink operations prematurely, which slows the optimization down and may lead to a false appearance of convergence [46]. Due to this difficulty, one would expect the number of iterations required to converge with Nelder-Mead to be especially bad in limited precision environments, though we note that there are a number of modifications that attempt to improve the method's robustness to noise [46,47].…”
Section: Nelder-meadmentioning
confidence: 99%
“…At LCLS, skilled human operators tune dozens of control parameters on-the-fly to achieve custom photon beam characteristics, and this process cuts into valuable time allocated for each user experiment. Model-independent optimizers can help automate tuning, with successful demonstrations using simplex [2,3], extremum seeking [4,5], and robust conjugate direction search [6,7]. However, these methods require a large number of expensive acquisitions and can become stuck in local optima.…”
mentioning
confidence: 99%
“…As our parameter space is a two-dimensional space (frequency and phase), the Simplex shape is a triangle. The main reason for choosing Simplex optimization is its ease of implementation in the real-time setting and its robustness (Huang, 2018;Price, Coope, & Byatt, 2002). The study protocol introduced in this paper is a real-time experiment (Figure 2A) with only 30 opportunities for functional connectivity calculation (2x15 stimulation blocks in training 1 and training 2).…”
Section: Parameter Optimizationmentioning
confidence: 99%