caa a22 4500 465821243 CHVBK 20180323112136.0 cr unu---uuuuu 170327e19901201xx s 000 0 eng 10.1007/BF01933219 doi (NATIONALLICENCE)springer-10.1007/BF01933219 An exact penalty function algorithm for semi-infinite programmes [Elektronische Daten] [C. Price, I. Coope] An algorithm for semi-inifinite programming using sequential quadratic programming techniques together with anL ∞ exact penalty function is presented, and global convergence is shown. An important feature of the convergence proof is that it does not require an implicit function theorem to be applicable to the semi-infinite constraints; a much weaker assumption concerning the finiteness of the number of global maximizers of each semi-infinite constraint is sufficient. In contrast to proofs based on an implicit function theorem, this result is also valid for a large class ofC 1 problems. BIT Foundations, 1990 65K05 nationallicence 90C30 nationallicence Price C. Department of Mathematics, University of Canterbury, Christchurch 1, New Zealand aut Coope I. Department of Mathematics, University of Canterbury, Christchurch 1, New Zealand aut BIT Numerical Mathematics Kluwer Academic Publishers 30/4(1990-12-01), 723-734 0006-3835 30:4<723 1990 30 10543 https://doi.org/10.1007/BF01933219 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF01933219 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Price C. Department of Mathematics, University of Canterbury, Christchurch 1, New Zealand aut NATIONALLICENCE 700 1- Coope I. Department of Mathematics, University of Canterbury, Christchurch 1, New Zealand aut NATIONALLICENCE 773 0- BIT Numerical Mathematics Kluwer Academic Publishers 30/4(1990-12-01), 723-734 0006-3835 30:4<723 1990 30 10543 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer