2005
DOI: 10.1364/ol.30.000649
|View full text |Cite
|
Sign up to set email alerts
|

Simplex optimization method for illumination design

Abstract: 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 n… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
27
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 54 publications
(28 citation statements)
references
References 4 publications
1
27
0
Order By: Relevance
“…4(b). The first 37 orthogonal Zernike standard polynomials were employed to fit the surface errors and the downhill simplex method [22,23] was applied to optimize the geometrical parameter GP . Figure 6 shows the change of the testing result on the surface error in the reverse optimization process, the testing result converged after three optimization cycles.…”
Section: Numerical Simulation Resultsmentioning
confidence: 99%
“…4(b). The first 37 orthogonal Zernike standard polynomials were employed to fit the surface errors and the downhill simplex method [22,23] was applied to optimize the geometrical parameter GP . Figure 6 shows the change of the testing result on the surface error in the reverse optimization process, the testing result converged after three optimization cycles.…”
Section: Numerical Simulation Resultsmentioning
confidence: 99%
“…For a nonimaging design, the most prevalent objectives to be optimized are efficiency, uniformity, angular emission, concentration factor, etc., 7,9 and as a rule, all of them must be optimized at the same time. In this paper, efficiency and uniformity are selected as the objectives of the MF as they conform to two of the most typical parameters involved in nonimaging systems.…”
Section: Dynamic Merit Functionmentioning
confidence: 99%
“…Equation (1) shows the direct influence of the weight factors on the MF and, therefore, on the optimization procedure. Commonly, the weights' factors fw i g are manually adjusted by a trial and error procedure; 7 this nonoptimal situation suggests the need to study methods for automatic adjustments of the weight factors fw i g. In this paper, we propose a new type of merit function, dynamic merit function (DMF), which automatically adjusts the weight factors fw i g during the progress of the optimization procedure. The variation of weight factors modifies the optimization problem, and DMF becomes an effective optimization method.…”
Section: Introductionmentioning
confidence: 99%
“…The simplex method and its variants have been shown to provide satisfying results in nonimaging optics design optimization [14][15][16]. However, their capabilities for nonlinear or high dimensional problems are limited [12,[17][18][19].…”
Section: Introductionmentioning
confidence: 99%