Share Email Print

Proceedings Paper

Optimal simplex optimization for optical design
Author(s): R. John Koshel
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Simplex optimization is a powerful method of finding minima in noisy merit function spaces, such as those for illumination. The standard simplex routine and a modified one developed by the author are applied to three lens design problems found in the literature: singlet, cemented doublet, and triplet. The starting conditions of the size of the simplex and the location in merit function space are investigated. It is found that the modified simplex routine provides better results than the standard one as the solution converges to the optimal solution, which is called the "end game". The standard simplex tends to provide better results than the modified one when operating in the "start game". The simplex results are compared to those from a commercially available lens design code. In most circumstances the commercially available code provides better performance in both iterations to convergence and quality of the result. The results presented herein provide confirmation that the modified simplex algorithm is a viable means of optimization for noisy merit function determination when in the neighborhood of local optima.

Paper Details

Date Published: 22 October 2004
PDF: 12 pages
Proc. SPIE 5524, Novel Optical Systems Design and Optimization VII, (22 October 2004); doi: 10.1117/12.562916
Show Author Affiliations
R. John Koshel, Spectrum Astro Inc. (United States)
Optical Sciences Ctr./Univ. of Arizona (United States)

Published in SPIE Proceedings Vol. 5524:
Novel Optical Systems Design and Optimization VII
Jose M. Sasian; R. John Koshel; Paul K. Manhart; Richard C. Juergens, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?