Skip to main content
Log in

Numerical experiments in semi-infinite programming

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

A quasi-Newton algorithm for semi-infinite programming using an L exact penalty function is described, and numerical results are presented. Comparisons with three Newton algorithms and one other quasi-Newton algorithm show that the algorithm is very promising in practice.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. B.M. Bell, “Global convergence of a semi-infinite optimisation method,” Appl. Math. Opt., vol. 21, pp. 89–110, 1990.

    Google Scholar 

  2. A.R. Conn and N.I.M. Gould, “An exact penalty function for semi-infinite programming,” Math. Prog., vol. 37, pp. 19–40, 1987.

    Google Scholar 

  3. I.D. Coope, “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, 1985.

  4. I.D. Coope and C.J. Price, “A two parameter exact penalty function for nonlinear programming,” J. Opt. Theory and Appl., vol. 83, pp. 49–61, 1994.

    Google Scholar 

  5. I.D. Coope and G.A. Watson, “A projected Lagrangian algorithm for semi-infinite programming,” Math. Prog., vol. 32, pp. 337–356, 1985.

    Google Scholar 

  6. C. Gonzaga, E. Polak, and R. Trahan, “An improved algorithm for optimisation problems with functional inequality constraints,” IEEE Trans. Automatic Control, vol. 25, no. 1, pp. 49–54, 1980.

    Google Scholar 

  7. E. Haaren-Retagne, “A semi-infinite programming algorithm for robot trajectory planning,” Ph.D. Thesis, Trier, Germany, 1992.

    Google Scholar 

  8. J.H. Halton, “On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals,” Numerische Mathematik, vol. 2, pp. 84–90, 1960.

    Google Scholar 

  9. R. Hettich, “An implementation of a discretization method for semi-infinite programming,” Math. Prog., vol. 34, pp. 354–361, 1986.

    Google Scholar 

  10. R. Hettich and K.O. Kortanek, “Semi-infinite programming: Theory, methods, and applications,” SIAM Review, vol. 35, pp. 380–429, 1993.

    Google Scholar 

  11. D.Q. Mayne and E. Polak, “A superlinearly convergent algorithm for constrained optimisation problems,” Math. Prog. Study, vol. 16, pp. 45–61, 1982.

    Google Scholar 

  12. E.R. Panier and A.L. Tits, “A globally convergent algorithm with adaptively refined discretization for semi-infinite optimisation problems arising in engineering design,” IEEE Trans. Automatic Control, vol. 34, no. 8, pp. 903–908, 1989.

    Google Scholar 

  13. C.J. Price, “Nonlinear Semi-Infinite Programming,” Ph.D. Thesis, Department of Mathematics, University of Canterbury, New Zealand, 1992.

    Google Scholar 

  14. C.J. Price and I.D. Coope, “An exact penalty function algorithm for semi-infinite programmes,” BIT, vol. 30, pp. 723–734, 1990.

    Google Scholar 

  15. R. Reemtsen, “Discretization methods for the solution of semi-infinite programming problems,” J. Opt. Theory and Appl., vol. 71, pp. 85–103, 1991.

    Google Scholar 

  16. Y. Tanaka, M. Fukushima, and T. Ibaraki, “A globally convergent SQP method for semi-infinite nonlinear optimisation,” J. Comp. Appl. Math., vol. 23, pp. 141–153, 1988.

    Google Scholar 

  17. G.A. Watson, “Globally convergent methods for semi-infinite programming,” BIT, vol. 21, pp. 362–373, 1981.

    Google Scholar 

  18. G.A. Watson, “Numerical experiments with globally convergent methods for semi-infinite programming problems,” in Semi-infinite programming and applications, A.V. Fiacco and K.O. Kortanek (Eds.), Proceedings of an International Symposium, Springer-Verlag, Berlin, 1983, pp. 193–205.

    Google Scholar 

  19. J.L. Zhou and A.L. Tits, “An SQP algorithm for finely discretized continuous minimax problems and other minimax problems with many objective functions,” SIAM J. Optimisation, to appear.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Price, C.J., Coope, I.D. Numerical experiments in semi-infinite programming. Comput Optim Applic 6, 169–189 (1996). https://doi.org/10.1007/BF00249645

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00249645

Keywords

Navigation