mlsanityData to 14 Oct 2026

Benchmarking five global optimization approaches for nano-optical shape optimization and parameter reconstruction

arXiv 1809.06674 ↗First posted 18 Sep 2018physics.comp-ph physics.optics stat.MLcited by 8

Not on the map. Why?

Abstract (arXiv)

Numerical optimization is an important tool in the field of computational physics in general and in nano-optics in specific. It has attracted attention with the increase in complexity of structures that can be realized with nowadays nano-fabrication technologies for which a rational design is no longer feasible. Also, numerical resources are available to enable the computational photonic material design and to identify structures that meet predefined optical properties for specific applications. However, the optimization objective function is in general non-convex and its computation remains resource demanding such that the right choice for the optimization method is crucial to obtain excellent results. Here, we benchmark five global optimization methods for three typical nano-optical optimization problems: removeddownhill simplex optimization, the limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) algorithm, particle swarm optimization, differential evolution, and Bayesian optimization addedparticle swarm optimization, differential evolution, and Bayesian optimization as well as multi-start versions of downhill simplex optimization and the limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) algorithm. In the shown examples from the field of shape optimization and parameter reconstruction, Bayesian optimization, mainly known from machine learning applications, obtains significantly better results in a fraction of the run times of the other optimization methods.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 Sep 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 3; 2022: 1; 2023: 2; 2024: 0; 2025: 0; 2026: 2.

8 papers.