You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither SPIE nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the SPIE website.
23 September 2015Reducible complexity in lens design
A major challenge in lens design is the presence of many local minima in the optimization landscape. However, unlike other global optimization problems, the lens design landscape has an additional structure, that can facilitate the design process: many local minima are closely related to minima of simpler problems. For discussing this property, in addition to local minima other critical points in the landscape must also be considered. Usually, in a global optimization problem with M variables one has to perform M-dimensional searches in order to find minima that are different from the known ones. We discuss here simple examples where, due to the special structure that is present, all types of local minima found by other methods can be obtained by a succession of one-dimensional searches. Replacing M-dimensional searches by a set of one-dimensional ones has very significant practical advantages. If the ability to reach solutions by decomposing the search in simple steps will survive generalization to more complex systems, new design tools using this property could have a significant impact on lens design.