当前位置: X-MOL 学术arXiv.cs.CE › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Addressing the Multiplicity of Solutions in Optical Lens Design as a Niching Evolutionary Algorithms Computational Challenge
arXiv - CS - Computational Engineering, Finance, and Science Pub Date : 2021-05-21 , DOI: arxiv-2105.10541
Anna V. Kononova, Ofer M. Shir, Teus Tukker, Pierluigi Frisco, Shutong Zeng, Thomas Bäck

Optimal Lens Design constitutes a fundamental, long-standing real-world optimization challenge. Potentially large number of optima, rich variety of critical points, as well as solid understanding of certain optimal designs per simple problem instances, provide altogether the motivation to address it as a niching challenge. This study applies established Niching-CMA-ES heuristic to tackle this design problem (6-dimensional Cooke triplet) in a simulation-based fashion. The outcome of employing Niching-CMA-ES `out-of-the-box' proves successful, and yet it performs best when assisted by a local searcher which accurately drives the search into optima. The obtained search-points are corroborated based upon concrete knowledge of this problem-instance, accompanied by gradient and Hessian calculations for validation. We extensively report on this computational campaign, which overall resulted in (i) the location of 19 out of 21 known minima within a single run, (ii) the discovery of 540 new optima. These are new minima similar in shape to 21 theoretical solutions, but some of them have better merit function value (unknown heretofore), (iii) the identification of numerous infeasibility pockets throughout the domain (also unknown heretofore). We conclude that niching mechanism is well-suited to address this problem domain, and hypothesize on the apparent multidimensional structures formed by the attained new solutions.

中文翻译:

解决光学透镜设计中的多种解决方案,这是一个发展中的小问题,是计算算法的挑战

最佳镜头设计构成了长期存在的基本的优化挑战。潜在的大量优化,丰富的关键点以及对每个简单问题实例的某些最佳设计的扎实了解,为解决此难题提供了动力。这项研究采用已建立的Niching-CMA-ES启发式方法,以基于仿真的方式解决了这个设计问题(6维Cooke三元组)。开箱即用的Niching-CMA-ES的结果证明是成功的,但在本地搜索者的协助下,它的效果最佳,该搜索者准确地将搜索推向了最佳状态。根据对该问题实例的具体了解,可以对获得的搜索点进行确认,并附带进行梯度和Hessian计算以进行验证。我们对该计算活动进行了广泛的报道,总体上导致(i)在一次运行中21个已知最小值中的19个位于位置;(ii)发现540个新的最优值。这些是形状类似于21个理论解的新的最小值,但是其中一些具有更好的价值函数值(迄今未知),(iii)识别整个域中的许多不可行口袋(迄今也是未知的)。我们得出的结论是,适当的机制非常适合解决这个问题领域,并根据获得的新解决方案形成的表观多维结构进行了假设。但是它们中的一些具有更好的价值函数值(迄今为止未知),(iii)识别整个域中的许多不可行口袋(迄今为止也是未知的)。我们得出的结论是,适当的机制非常适合解决这个问题领域,并根据获得的新解决方案形成的表观多维结构进行了假设。但是它们中的一些具有更好的价值函数值(迄今为止未知),(iii)识别整个域中的许多不可行口袋(迄今为止也是未知的)。我们得出的结论是,适当的机制非常适合解决这个问题领域,并根据获得的新解决方案形成的表观多维结构进行了假设。
更新日期:2021-05-25
down
wechat
bug