Skip to main content
SpringerLink
Log in

On Discrete Minimax Problems in R Using Interval Arithmetic

  • Published:
Reliable Computing

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

Interval algorithms for bounding discrete minimax function values of problems in which the constituent minimax functions are continuously differentiable functions of one real variable in a bounded closed interval are presented, both with and without inequality constraints represented by continuously differentiable constraint functions.

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

Access this article

Log in via an institution

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. Alefeld, G. and Herzberger, J.: Introduction to Interval Computations, Academic Press, London, 1983.

    Google Scholar 

  2. Hammer, R., Hocks, M., Kulisch, U., and Ratz, D.: Numerical Toolbox for Verified Computing I, Springer-Verlag, Berlin, Heidelberg, 1993.

    Google Scholar 

  3. Hansen, E. R.: Global Optimization Using Interval Analysis—the One-Dimensional Case, Journal of Optimization Theory and Applications 29 (1979), pp. 331-344.

    Google Scholar 

  4. Hansen, E. R.: Global Optimization Using Interval Analysis, Marcel Dekker, Inc., New York, 1992.

    Google Scholar 

  5. Huang Zhenyu: An Interval Entropy Penalty Method for Nonlinear Global Optimization, Reliable Computing 4(1) (1998), pp. 15-25.

    Google Scholar 

  6. Neumaier, A.: Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, 1990.

    Google Scholar 

  7. Kearfott, R. B.: Rigorous Global Search: Continuous Problems, Kluwer Academic Publishers, Dordrecht, 1996.

    Google Scholar 

  8. Shen Zhue, Huang Zhen Yu, and Wolfe, M. A.: An Interval Maximum Entropy Method for a Discrete Minimax Problem, Applied Mathematics and Computation 87 (1997), pp. 49-68.

    Google Scholar 

  9. Wolfe, M. A.: On Global Optimization in R Using Interval Arithmetic, Optimization Methods and Software 3 (1994), pp. 61-76.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of St Andrews, School of Mathematical and Computational Sciences, Mathematical Institute, North Haugh, St Andrews, Fife KY16 9SS, Scotland

    Michael A. Wolfe

Authors
  1. Michael A. Wolfe
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wolfe, M.A. On Discrete Minimax Problems in R Using Interval Arithmetic. Reliable Computing 5, 371–383 (1999). https://doi.org/10.1023/A:1009930013647

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009930013647

Keywords

Search

Navigation