Abstract
A perturbation method for solving semi-infinite optimization problems is introduced. The approach is to use the continuous structure of the problem rather than an a priori discretization of the constraint set. A duality theory for infinite-dimensional convex programs is used to construct a nonlinear dual problem which is a finite-dimensional unconstrained concave problem. This induced dual problem penalizes the classical semi-infinite problem. This formulation lends itself to computing a solution of the dual by Newton's type method and allows for solving both the primal and dual problems. Implementation of a primal-dual algorithm, the connection with interior point methods, and further results are briefly discussed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
