Abstract
This paper considers general non-linear semi-infinite programming problems and presents an implementable method which employs an exact L ∞ penalty function. Since the L ∞ penalty function is continuous even if the number of representative constraints changes, trust-region techniques may effectively be adopted to obtain global convergence. Numerical results are given to show the efficiency of the proposed algorithm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
