ABSTRACT
We show that in the lens design landscape saddle points exist that are closely related to local minima of simpler problems. On the basis of this new theoretical insight we develop a systematic and efficient saddle-point method that uses a-priori knowledge for obtaining new local minima. In contrast with earlier saddle-point methods, the present method can create both positive and negative lenses. As an example, by successively using the method a good-quality local minimum is obtained from a poor-quality one. The method could also be applicable in other global optimization problems that satisfy the requirements discussed in this paper.
ABSTRACT
In lens design, damped least-squares methods are typically used to find the nearest local minimum to a starting configuration in the merit function landscape. In this paper, we explore the use of such a method for a purpose that goes beyond local optimization. The merit function barrier, which separates an unsatisfactory solution from a neighboring one that is better, can be overcome by using low damping and by allowing the merit function to temporarily increase. However, such an algorithm displays chaos, chaotic transients and other types of complex behavior. A successful escape of the iteration trajectory from a poor local minimum to a better one is associated with a crisis phenomenon that transforms a chaotic attractor into a chaotic saddle. The present analysis also enables a better understanding of peculiarities encountered with damped least-squares algorithms in conventional local optimization tasks.