Abstract
This paper introduces a global approach to the semi-infinite programming problem that is based upon a generalisation of the l1 exact penalty function. The advantages are that the ensuing penalty function is exact and the penalties include all violations. The merit function requires integrals for the penalties, which provides a consistent model for the algorithm. The discretization is a result of the approximate quadrature rather than an a priori aspect of the model.
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.