Skip to main content

A common root of three minimization problems

  • Chapter
New Trends in Mathematical Programming

Part of the book series: Applied Optimization ((APOP,volume 13))

  • 415 Accesses

Abstract

It is showed that three minimization problems from three different fields of mathematics (approximation theory, convex geometry, matrix theory) can be transformed easily to a simple problem of a linear algebraic type. The latter one is then solved in an elementary way using another field: the theory of inequalities (the Hölder inequality and its simple extensions).

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

Access this chapter

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. J.-P. Serre, “Correspondences and dictionaries in geometry and number theory”, In: Abstracts of the 2nd European Congress of Mathematics, Budapest, July 22–26, 1996, J.Bolyai Math.Soc., 1996, p. 5.

    Google Scholar 

  2. E. W. Cheney, Introduction to Approximation Theory, McGraw-Hill, New York, 1966.

    MATH  Google Scholar 

  3. H. S. Shapiro, Topics in Approximation Theory, Springer, Berlin- Heidelberg-New York, 1971.

    MATH  Google Scholar 

  4. I. Singer, Best Approximation in Normed Linear Spaces by Elements of Linear Subspaces, Springer, Berlin-Heidelberg-New York, 1970.

    MATH  Google Scholar 

  5. J. Miao, A. Ben-Israel, On l p -approximate solutions of linear equations, Linear Alg. Appl., 199 (1994), 305–327.

    Article  MathSciNet  MATH  Google Scholar 

  6. J. Miao, A. Ben-Israel, The Geometry of Basic, Approximate, and Minimum Norm Solutions of Linear Equations, Linear Alg. Appl., 216 (1995), 25–41.

    Article  MathSciNet  MATH  Google Scholar 

  7. B. Uhrin, An elementary constructive approach to discrete linear l p approximation, 0 < p ≤ +∞, In: Szabados J., Tandori K., Eds., Proc. Appr. Theory Conference held in Kecskemét (Hungary), 1990, Coll. Math. Soc. J. Bolyai, Vol. 58, 1991, pp. 673–688.

    Google Scholar 

  8. B. Uhrin, Touching points of a star-shaped set with an affine subspace, Linear Alg. Appl., 171 (1992), 149–159

    Article  MathSciNet  MATH  Google Scholar 

  9. G. H. Hardy, J. E. Littlewood, G. Pólya, Inequalities, Cambridge Univ. Press, Cambridge, 1951.

    Google Scholar 

  10. R. Horst, bang may, “Global Optimization, Deterministic Approaches”, Springer, Berlin — Heidelberg — New York, 1990.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Uhrin, B. (1998). A common root of three minimization problems. In: Giannessi, F., Komlósi, S., Rapcsák, T. (eds) New Trends in Mathematical Programming. Applied Optimization, vol 13. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2878-1_22

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-2878-1_22

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4793-2

  • Online ISBN: 978-1-4757-2878-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics