Efficient method for accelerating line searches in adjoint optimization of photonic devices by combining Schur complement domain decomposition and Born series expansions
Abstract
A line search in a gradient-based optimization algorithm solves the problem of determining the optimal learning rate for a given gradient or search direction in a single iteration. For most problems, this is determined by evaluating different candidate learning rates to find the optimum, which can be expensive. Recent work has provided an efficient way to perform a line search with the use of the Shanks transformation of a Born series derived from the Lippman-Schwinger formalism. In this paper we show that the cost for performing such a line search can be further reduced with the use of the method of the Schur complement domain decomposition, which can lead to a 10-fold total speed-up resulting from the reduced number of iterations to convergence and reduced wall-clock time per iteration.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Feb 11, 2022
- Source ID
- 10.1364/oe.451718
Entities
People
- Nathan Z. Zhao
- Salim Boutami
- Shanhui Fan
Organizations
- Air Force Office of Scientific Research
- Grenoble Alpes University
- Stanford University