Answers are grounded in this paper and cite their sources.
In this paper, we consider an optimization problem of lens adjustment in semiconductor lithography equipment. The problem to obtain optimal adjustment of lens can be naturally formulated as a convex minimization problem. However, in such a formulation the objective function is convex but contains many nondifferentiable points, and thus methods based on derivatives cannot be applied. Other approaches using derivative-free optimization or meta-heuristic methods cannot guarantee that obtained solutions are truly optimal. From such a background, we formulate the problem as quadratically constrained and second-order cone programming problems, which can be handled by solvers using an interior point method. With the proposed formulations, computational simulations show that optimal adjustment of lens is obtained in a practical computational time.
No takes yet. Share an insight, caveat, or question.
Shinano et al. (2009) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: