Abstract
We present a new numerical solution method for semi-infinite optimization problems. Its main idea is to adaptively construct convex relaxations of the lower level problem, replace the relaxed lower level problems equivalently by their Karush–Kuhn–Tucker conditions, and solve the resulting mathematical programs with complementarity constraints. This approximation produces feasible iterates for the original problem. The convex relaxations are constructed with ideas from the $\alpha$BB method of global optimization. The necessary upper bounds for second derivatives of functions on box domains can be determined using the techniques of interval arithmetic, where our algorithm already works if only one such bound is available for the problem. We show convergence of stationary points of the approximating problems to a stationary point of the original semi-infinite problem within arbitrarily given tolerances. Numerical examples from Chebyshev approximation and design centering illustrate the performance of the method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.