Abstract
Optical lens design problems are solved by numerical optimization. If we describe an optical lens system by constructive parameters, we may identify such a system by a vectorx ∈ ℝn. To find an adequate system for a given problem, we have to organize the optimization process in a parameter space with a fixed dimensionn. Often, such an optimization leads to inadequate results. For this reason, we have to alter the number of lenses contained in the system. Consequently, we have to change the dimension of the space for the parametric description of the lens system. This paper describes a special sequential cluster algorithm to realize the move from one parameter space to another by computation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Walk, M., andNiklaus, J.,Some Remarks on Computer Aided Design of Optical Lens Systems, Journal of Optimization Theory and Applications, Vol. 59, pp. 173–181, 1988.
Parzen, E.,On Estimation of a Probability Density Function and Mode, Annals of Mathematical Statistics, Vol. 33, pp. 1065–1076, 1962.
Wapnik, W. N., andTscherwonenkis, A. J.,Theorie der Zeichenerkennung, Akademie-Verlag, Berlin, DDR, 1981.
Elsner, G.,Lernfähige Algorithmen im Modellierungsprozess Optischer Systeme, Dissertation, Sektion Mathematik, Friedrich-Schiller-Universität, Jena, DDR, 1984.
Author information
Authors and Affiliations
Additional information
Communicated by L. C. W. Dixon
This work was supported by the Department of Mathematics of the Friedrich Schiller University in Jena, in cooperation with the research center of Kombinat VEB Carl Zeiss Jena, Jena, DDR.
Rights and permissions
About this article
Cite this article
Elsner, G. A new sequential cluster algorithm for optical lens design. J Optim Theory Appl 59, 165–172 (1988). https://doi.org/10.1007/BF00938306
Issue Date:
DOI: https://doi.org/10.1007/BF00938306