Abstract
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bandler, J. W. and C. Charalambous,Nonlinear programming using minimax techniques, J. of Opt. Th. and Appl. 13, 607–618 (1974).
Conn, A. R. and N. I. M. Gould,An exact penalty function for semi-infinite programming, Math. Prog. 37, 19–40 (1987).
Coope, I. D.,The Maratos effect in sequential quadratic programming algorithms using the L 1 exact penalty function, Technical Report CS85-32, Computer Science Department, University of Waterloo, August 1985.
Coope, I. D. and G. A. Watson,A projected Lagrangian algorithm for semi-infinite programming, Math. Prog. 32, 337–356 (1985).
Gill, P. E. and W. Murray,The computation of Lagrange multiplier estimates for constrained optimization, Math. Prog. 17, 32–60 (1976).
Gustafson, S.-Å.,A three phase algorithm for semi-infinite programmes, inSemi-Infinite Programming, and Applications, eds. A. V. Fiacco, and K. O. Kortanek, Springer-Verlag, Berlin (1983).
Mayne, D. Q. and E. Polak,A superlinearly convergent algorithm for constrained optimization problems, Math. Prog. Study 17, 45–61 (1982).
Powell, M. J. D.,The convergence of variable metric methods for nonlinearly constrained optimization calculations, inNonlinear Programming 3, eds. O. L. Mangasasarian, R. R. Meyer, and S. M. Robinson, Academic Press, New York, (1978).
Price, C. J., PhD thesis, forthcoming.
Tanaka, Y., M. Fukushima, and T. Ibaraki,A globally convergent SQP method for semi-infinite non-linear optimization, Journal of Computational and Applied Mathematics 23, 141–153 (1988).
Watson, G. A.,Globally convergent methods for semi-infinite programming, BIT 21, 362–373 (1981).