000928669 001__ 928669
000928669 003__ SzGeCERN
000928669 005__ 20240223163513.0
000928669 041__ $$aeng
000928669 100__ $$aShang, Hairong
000928669 245__ $$aA Parallel Simplex Optimizer and Its Application to High-Brightness Storage Ring Design
000928669 260__ $$c2005
000928669 520__ $$aOptimization is commonly used in accelerator design to find linear optics solutions. Such optimizations are usually fairly fast as linear optics computations are themselves fast. For high-brightness storage rings, optimization of nonlinear elements (e.g., sextupoles) is also important in obtaining sufficient dynamic aperture. However, this can be very time onsuming as the basic calculations are time consuming. We have developed an efficient parallel Simplex optimizer that runs on a Linux cluster. It can optimize the result of running essentially any program or script that returns a penalty function value. We have used this optimizer with elegant to optimize dynamic aperture of storage ring designs. We discuss the optimization algorithm and performance, design of penalty functions, and optimization results.
000928669 595__ $$aSIS PAC05-2006
000928669 65017 $$2SzGeCERN$$aAccelerators and Storage Rings
000928669 690C_ $$aARTICLE
000928669 700__ $$aBorland, Michael
000928669 8564_ $$uhttps://accelconf.web.cern.ch/p05/PAPERS/FPAT089.PDF$$yPublished version from JACoW
000928669 901__ $$uANL, Argonne, Illinois
000928669 916__ $$sn$$w200606
000928669 960__ $$a13
000928669 961__ $$c20060717$$h2034$$lCER01$$x20060208
000928669 963__ $$aPUBLIC
000928669 962__ $$b719664$$k4230$$nknoxville20050516
000928669 970__ $$a002596516CER
000928669 980__ $$aARTICLE