Skip to main content
SpringerLink
Log in

Exact Penalty Function Methods for Nonlinear Semi-Infinite Programming

  • Chapter
Semi-Infinite Programming

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 25))

Abstract

Exact penalty function algorithms have been employed with considerable success to solve nonlinear semi-infinite programming problems over the last sixteen years. The development of these methods is traced from the perspective of standard nonlinear programming algorithms. The extension of standard theory to the semi-infinite case is illustrated through simple examples and some of the theoretical and computational difficulties are highlighted.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. M. Ali and C. Storey. Topographical multi-level single linkage. J. Global Optimization, 5:349–358, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  2. B. M. Bell. Global convergence of a semi-infinite optimisation method. Appl. Math. Opt., 21(1):89–110, 1990.

    Article  Google Scholar 

  3. C. G. E. Boender and A. H. G. Rinnooy Kan. Bayesian stopping rules for multistart global optimization methods. Math. Prog., 37:59–80, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  4. R. Bojanic and R. Devore. On polynomials of best one-sided approximation. L’Ensiegnement Mathematique, 12(2):139–164, 1966.

    MATH  MathSciNet  Google Scholar 

  5. A. R. Conn and N. I. M. Gould. An exact penalty function for semi-infinite programming. Math. Prog., 37:19–40, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  6. I. D. Coope and C. J. Price. A two-parameter exact penalty function for nonlinear programming. Journal of Optimization Theory & Applications, 83(1):49–61, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  7. I. D. Coope and G. A. Watson. A projected Lagrangian algorithm for semi-infinite programming. Math. Prog., 32:337–356, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  8. Y. J. Evtushenko. Numerical Optimisation Techniques. Optimization Software inc. Publications Division, 1985.

    Book  Google Scholar 

  9. A. C. Fiacco and K. O. Kortanek, editors. Semi-Infinite Programming and Applications, Lecture Notes in Economics and Mathematical Systems, no. 215. Springer-Verlag, Berlin, 1983.

    Google Scholar 

  10. C. E. Gonzaga, E. Polak, and R. Trahan. An improved algorithm for optimisation problems with functional inequality constraints. IEEE Trans. Automatic Control, 25(l):49–54, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  11. S.-Å. Gustafson. On the computational solution of a class of generalized moment problems. SIAM J. Numer. Anal, 7:343–357, 1970.

    Article  MATH  MathSciNet  Google Scholar 

  12. S.-Å. Gustafson. A three phase algorithm for semi-infinite programmes, pages 138–157. In Fiacco and Kortanek [9], 1983.

    Google Scholar 

  13. J. H. Halton. On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Numerische Mathematik, 2:84–90, 1960.

    Article  MathSciNet  Google Scholar 

  14. R. Hettich. An implementation of a discretization method for semi-infinite programming. Math. Prog., 34:354–361, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  15. R. Hettich and W. van Honstede. On quadratically convergent methods for semi-infinite programming. In R. Hettich, editor, Semi-Infinite Programming, pages 97–111. Springer-Verlag, Berlin, 1979.

    Chapter  Google Scholar 

  16. H. T. Jongen, J.-J. Rückmann, and O. Stein. Generalized semi-infinite optimization: A first order optimality condition and example. Technical Report Nr. 95–24, Universität Trier, Mathematik/Informatik, 1995.

    Google Scholar 

  17. R. H. Mladineo. An algorithm for finding the global maximum of a multimodal, multivariate function. Math. Prog., 34:188–200, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  18. R. E. Moore and H. Ratschek. Inclusion functions and global optimisation II. Math. Prog., 41:341–356, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  19. H. Niederreiter. Quasi Monte Carlo methods and pseudo-random numbers. Bulletin of the American Math. Soc., 84(6):957–1041, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  20. 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, 34(8):903–908, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  21. T. Pietrzkowski. The potential method for conditional maxima in locally compact metric spaces. Numer. Math., 14:325–329, 1970.

    Article  MathSciNet  Google Scholar 

  22. C. J. Price. Non-Linear Semi-Infinite Programming. PhD thesis, University of Canterbury, Christchurch, New Zealand, 1992.

    Google Scholar 

  23. C. J. Price and I. D. Coope. An exact penalty function algorithm for semi-infinite programmes. BIT, 30:723–734, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  24. C. J. Price and I. D. Coope. Numerical experiments in semi-infinite programming. Computational Optimisation and Applications, 6(2):169–189, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  25. H. Ratschek. Inclusion functions and global optimisation. Math. Prog., 33:300–317, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  26. R. Reemtsen. Discretization methods for the solution of semi-infinite programming problems. Journal of Optimization Theory & Applications, 23:141–153, 1988.

    Google Scholar 

  27. A. H. G. Rinnooy Kan and G. T. Timmer. Stochastic global optimisation methods part I: Clustering methods. Math. Prog., 39:27–56, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  28. A. H. G. Rinnooy Kan and G. T. Timmer. Stochastic global optimisation methods part II: Multi-level methods. Math. Prog., 39:57–78, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  29. Y. Tanaka, M. Fukushima, and T. Hasegawa. Implementable L∞ penalty function method for semi-infinite optimisation. Int. J. Systems Sci., 18(8): 1563–1568, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  30. Y. Tanaka, 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.

    Article  MATH  MathSciNet  Google Scholar 

  31. A. Törn and A. Zilinskas. Global Optimisation, Lecture Notes in Computer Science No. 350. Springer-Verlag, Berlin-Heidelberg, 1989.

    Google Scholar 

  32. G. A. Watson. Globally convergent methods for semi-infinite programming. BIT, 21:362–373, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  33. G. A. Watson. Numerical experiments with globally convergent methods for semi-infinite programming problems, pages 193–205. In Fiacco and Kortanek [9], 1983.

    Google Scholar 

  34. G. A. Watson. Lagrangian methods for semi-infinite programming problems. In E. J. Anderson and A. B. Philpott, editors, Infinite Dimensional Linear Programming, Lecture Notes in Economics and Mathematical Systems no. 259, pages 90–107. Springer-Verlag, 1985.

    Google Scholar 

  35. G. R. Wood. Multidimensional bisection applied to global optimization. Computers and Mathematics with Applications, 21:161–172, 1991.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  37. 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. Optimization, 6:461–487, 1996.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand

    Ian D. Coope & Christopher J. Price

Authors
  1. Ian D. Coope
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christopher J. Price
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics, Brandenburg Technical University of Cottbus, Germany

    Rembert Reemtsen

  2. Institute of Applied Mathematics, University of Erlangen-Nuremberg, Germany

    Jan-J. Rückmann

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Coope, I.D., Price, C.J. (1998). Exact Penalty Function Methods for Nonlinear Semi-Infinite Programming. In: Reemtsen, R., Rückmann, JJ. (eds) Semi-Infinite Programming. Nonconvex Optimization and Its Applications, vol 25. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2868-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-2868-2_5

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4795-6

  • Online ISBN: 978-1-4757-2868-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation