Skip to main content

A fast algorithm for the Euclidean distance location problem

  • 438 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 909)

Keywords

  • Descent Direction
  • Quadratic Convergence
  • Linear Convergence
  • Courant Institute
  • Steep Descent Direction

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • P. H. Calamai and A. R. Conn (1980). A stable algorithm for solving the multifacility location problem involving Euclidean distances, SIAM J. Scient. and Stat. Comp. 1, pp. 512–526.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • J. A. Chatelon, D. W. Hearn and T. J. Lowe (1978). A subgradient alogirthm for certain minimax and minisum problems. Math. Prog. 15, pp. 130–145.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • F. Cordellier and J. Ch. Fiorot (1978). On the Fermat-Weber problem with convex cost functionals, Math. Prog. 14, pp. 295–311.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • U. Eckhardt (1975). On an optimization problem related to minimal surfaces with obstacles, in R. Bulirsch, W. Oettli and J. Stoer, eds., Optimization and Optimal Control, Lecture Notes in Mathematics 477, Springer-Verlag, Berlin and New York.

    CrossRef  Google Scholar 

  • U. Eckhardt (1980). Weber's problem and Weiszfeld's algorithm in general spaces, Math. Prog. 18, pp. 186–196.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • R. L. Francis, and J. M. Goldstein (1974). Location theory: a selective bibliography, Operations Research 22, pp. 400–410.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • H. W. Kuhn (1967). On a pair of dual nonlinear programs, in Nonlinear Programming (J. Abadie, ed.), North-Holland, Amsterdam, pp. 38–54.

    Google Scholar 

  • H. W. Kuhn (1973). A note on Fermat's problem, Math. Prog. 4, pp. 98–107.

    CrossRef  MATH  Google Scholar 

  • M. L. Overton (1981). A quadratically convergent algorithm for minimizing a sum of Euclidean norms, Computer Science Dept. Report 030, Courant Institute of Mathematical Sciences, New York University.

    Google Scholar 

  • B. N. Parlett (1980). The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, N.J.

    MATH  Google Scholar 

  • S. Schechter (1970). Minization of a convex function by relaxation, in Integer and Nonlinear Programming (J. Abadie, ed.), North-Holland, Amsterdam and London.

    Google Scholar 

  • H. Voss and U. Eckhardt (1980). Linear convergence of generalized Weiszfeld's method. Computing 25, pp. 243–251.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • E. Weiszfeld (1937). Sur le point par lequel la somme des distances de n points donnés est minimum, Tohoku Mathematics J. 43, pp. 355–386.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1982 Springer-Verlag

About this paper

Cite this paper

Overton, M.L. (1982). A fast algorithm for the Euclidean distance location problem. In: Hennart, J.P. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092963

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38986-6

  • eBook Packages: Springer Book Archive