Skip to main content

Embedding theorems for cones and applications to classes of convex sets occurring in interval mathematics

  • Conference paper
  • First Online:
Interval Mathematics 1985 (IMath 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 212))

Included in the following conference series:

Abstract

This paper gives a survey of embedding theorems for cones and their application to classes of convex sets occurring in interval mathematics.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fischer, H.: On the Rådström embedding theorem. Analysis 5, 15–28 (1985).

    Google Scholar 

  2. Hörmander, L.: Sur la fonction d'appui des ensembles convexes dans un espace localement convexe. Arkiv Mat. 3, 181–186 (1954–1958).

    Google Scholar 

  3. Jahn, K.U.: Maximale Fixpunkte von Intervallfunktionen. Computing 33, 141–151 (1984).

    Google Scholar 

  4. Kaucher, E.: Algebraische Erweiterungen der Intervallrechnung unter Erhaltung der Ordnungs-und Verbandsstrukturen. Computing Suppl. 1, 65–79 (1977).

    Google Scholar 

  5. Kracht, M., and Schröder, G.: Eine Einführung in die Theorie der quasilinearen Räume mit Anwendung auf die in der Intervallrechnung auftretenden Räume. Math.-Phys. Semesterberichte Neue Folge 20, 226–242 (1973).

    Google Scholar 

  6. Luxemburg, W.A.J., and Zaanen, A.C.: Riesz Spaces I. Amsterdam — New York — Oxford: North-Holland 1971.

    Google Scholar 

  7. Mayer, O.: Algebraische und metrische Strukturen in der Intervallrechnung und einige Anwendungen. Computing 5, 144–162 (1970).

    Google Scholar 

  8. Moore, R.E.: Interval Analysis. Englewood Cliffs, New Jersey: Prentice-Hall 1966.

    Google Scholar 

  9. Nickel, K.: Verbandstheoretische Grundlagen der Intervall-Mathematik. In: Interval Mathematics. Lecture Notes in Computer Science, vol. 29, pp. 251–262. Berlin — Heidelberg — New York: Springer 1975.

    Google Scholar 

  10. Rådström, H.: An embedding theorem for spaces of convex sets. Proc. Amer. Math. Soc. 3, 165–169 (1952).

    Google Scholar 

  11. Ratschek, H.: Nichtnumerische Aspekte der Intervallmathematik. In: Interval Mathematics. Lecture Notes in Computer Science, vol. 29, pp. 48–74. Berlin — Heidelberg — New York: Springer 1975.

    Google Scholar 

  12. Schaefer, H.H.: Banach Lattices and Positive Operators. Berlin — Heidelberg — New York: Springer 1974.

    Google Scholar 

  13. Schmidt, K.D.: Embedding theorems for classes of convex sets. Acta Appl. Math. (to appear).

    Google Scholar 

  14. Schmidt, K.D.: Embedding theorems for classes of convex sets in a hypernormed vector space. Analysis (to appear).

    Google Scholar 

  15. Urbanski, R.: A generalization of the Minkowski-Rådström-Hörmander theorem. Bull. Acad. Polon. Sci. 24, 709–715 (1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Karl Nickel

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schmidt, K.D. (1986). Embedding theorems for cones and applications to classes of convex sets occurring in interval mathematics. In: Nickel, K. (eds) Interval Mathematics 1985. IMath 1985. Lecture Notes in Computer Science, vol 212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16437-5_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-16437-5_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16437-1

  • Online ISBN: 978-3-540-39779-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics