计算机科学
光子学
算法
离散优化
最优化问题
数学优化
背景(考古学)
平滑的
连续优化
离散空间
离散化
全局优化
数学
多群优化
数学分析
古生物学
物理
光学
计算机视觉
生物
作者
Olivier Teytaud,Pauline Bennet,Antoine Moreau
标识
DOI:10.1016/j.photonics.2022.101072
摘要
The photonics community counts on inverse design approaches to provide new designs of miniaturized photonic components. Although the structures are composed of two materials only, the dominant method used to tackle such a problem is to make the problem continuous through a relaxation of the binary constraint and to use a gradient-based approach. Global optimization algorithms working on continuous problems actually often fail to produce satisfying solutions in such a context characterized by a large number of parameters – especially when space is discretized into a large number of pixels or voxels. However, we show here for three different photonics problems that global discrete optimization algorithms, which are adapted to this kind of problems, can provide efficient solutions which are relatively regular, physically understandable and close to being buildable. Such algorithms constitute overlooked but valuable tools for inverse design problems. Our preferred method is using a starting point provided by a gradient based algorithm, and run an optimization using Lengler’s algorithm equipped with a simple smoothing operator to make the algorithm aware of the physical nature of the problem.
科研通智能强力驱动
Strongly Powered by AbleSci AI