Answers are grounded in this paper and cite their sources.
A modified simplex optimization method is developed for the design of illumination systems. The simplex method is a judicious choice for illumination optimization because of its robustness and convergence properties. To optimize the simplex method, its four parameters are adjusted dependent on the dimensionality of the space to converge with fewer iterations. This work is presented for the end game, when the optimizer is converging on a local optimum rather than searching for it. Up to a 37% reduction in the number of computations is realized. An example using a compound parabolic concentrator is compared between the standard and the modified simplex methods, providing over 22% improvement in the end game.
No takes yet. Share an insight, caveat, or question.
R. John Koshel (2005) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: