Abstract

One of tasks of modern computational optics is the problem of complete automatization of an optical system (OS) design procedure according to different criteria. The widespread local optimization techniques have a significant drawback: initial OSs with good quality are typically required. To solve the problem of finding the lowest value of the evaluation (merit) function in given space of allowed parameters, modern global optimization (GO) methods can be applied. For purpose of automated lens design, different authors have proposed to use such GO techniques as simulation annealing, genetic algorithms, etc. In this paper, the possibilities of one adaptive method (namely, differential evolution Cauchy, proposed in 2013) are numerically studied. An algorithm of the method is characterized by presence of an internal mechanism for self-adapting the coefficients of a classical differential evolution algorithm. Besides, it incorporates the Cauchy distribution to generate new "random" values of above-mentioned coefficients. The algorithm has been implemented in own computer program, developed for automated lens design. An experimental verification of the method’s effectiveness has been done during the design of several OS systems, similar to those, presented recently in US patents.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.