An efficient algorithm for minimizing a sum of euclidean norms with applications

SIAM Journal on Optimization

Volumn 7, Issue 4, 1997, Pages 1017-1036

  Xue, Guoliang ^a   Ye, Yinyu ^b  

^a University of Vermont   (United States)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

Euclidean facilities location; Interior point algorithm; Minimizing a sum of euclidean norms; Polynomial time; Shortest networks; Steiner minimum trees

Indexed keywords

EID: 0031285688     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623495288362     Document Type: Article

References (33)

1. K. D. ANDERSEN, An efficient Newton barrier method for minimizing a sum of Euclidean norms, SIAM J. Optim., 6 (1996), pp. 74-95.
2. K. D. ANDERSEN AND E. CHRISTIANSEN, A Symmetric Primal-Dual Newton Method for Minimizing a Sum of Norms, manuscript, Odense University, Denmark, 1995.
3. P. H. CALAMAI AND A. R. CONN, A second-order method for solving the continuous multifacility location problem, in Numerical Analysis: Proceedings of the Ninth Biennial Conference, G. A. Watson, ed., Dundee, Scotland, Lecture Notes in Mathematics 912, Springer-Verlag, Berlin, 1982, pp. 1-25.
4. p norm location problems, Math. Programming, 38 (1987), pp. 75-109.
5. R. CHANDRASEKARAN AND A. TAMIR, Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem, Math. Programming, 44 (1989), pp. 293-295.
6. R. CHANDRASEKARAN AND A. TAMIR, Algebraic optimization: The Fermat-Weber location problem, Math. Programming, 46 (1990), pp. 219-224.
7. A. R. CONN AND M. L. OVERTON, A Primal-Dual Interior Point Method for Minimizing a Sum of Euclidean Distances, 1995, manuscript.
8. D. DEN HERTOG, Interior Point Approach to Linear, Quadratic and Convex Programming, Kluwer Academic Publishers, Norwell, MA, 1994.
9. J. W. EYSTER, J. A. WHITE, AND W. W. WIERWILLE, On solving multifacility location problems using a hyperboloid approximation procedure, AIIE Transactions, 5 (1973), pp. 1-6.
10. R. L. FRANCIS AND A. V. CABOT, Properties of a multifacility location problem involving Euclidean distances, Naval Res. Logist., 19 (1972), pp. 335-353.
11. R. L. FRANCIS, LEON F. MCGINNIS, JR., AND JOHN A. WHITE, Facility Layout and Location: An Analytical Approach, Prentice-Hall, Englewood Cliffs, NJ, 1991.
12. E. N. GILBERT AND H. O. POLLAK, Steiner minimal trees, SIAM J. Appl. Math., 16 (1968), pp. 1-29.
13. O. GÜLER, Barrier Functions in Interior Point Methods, manuscript, 1994.
14. F. K. HWANG, A linear time algorithm for full Steiner trees, Oper. Res. Lett., 4 (1986), pp. 235-237.
15. F. K. HWANG AND J. F. WENG, The shortest network under a given topology, J. Algorithms, 13 (1992), pp. 468-488.
16. M. KOJIMA, Tokyo Institute of Technology, Japan, 1995, private communication.
17. H. W. KUHN, On a pair of dual nonlinear programs, in Nonlinear Programming, J. Abadie, ed., North-Holland, Amsterdam, 1967, pp. 39-54.
18. H. W. KUHN, A note on Fermat's problem, Math. Programming, 4 (1973), pp. 98-107.
19. R. F. LOVE, J. G. MORRIS, AND G. O. WESOLOWSKY, Facilities Location: Models & Methods, North-Holland, Amsterdam, 1988.
20. Z. A. MELZAK, On the problem of Steiner, Canad. Math. Bull., 16 (1961), pp. 143-148.
21. W. MIEHLE, Link length minimization in networks, Oper. Res., 6 (1958), pp. 232 243.
22. YU. E. NESTEROV AND A. NEMIROVSKII, Interior Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, 1994.
23. YU. E. NESTEROV AND M. J. TODD, Self-Scaled Barriers and Interior-Point Methods for Convex Programming, manuscript.
24. L. M. OSTRESH, The multifacility location problem: Applications and descent theorems, J. Regional Science, 17 (1977), pp. 409-419.
25. M. L. OVERTON, A quadratically convergent method for minimizing a sum of Euclidean norms, Math. Programming, 27 (1983), pp. 34-63.
26. J. B. ROSEN AND G. L. XUE, On the convergence of Miehle's algorithm for the Euclidean multifacility location problem, Oper. Res., 40 (1992), pp. 188-191.
27. J. B. ROSEN AND G. L. XUE, On the convergence of a hyperboloid approximation procedure for solving the perturbed Euclidean multifacility location problem, Oper. Res., 41 (1993), pp. 1164-1171.
28. W. D. SMITH, How to find Steiner minimal trees in Euclidean d-space, Algorithmica, 7 (1992), pp. 137-177.
29. C. Y. WANG ET AL., On the convergence and rate of convergence of an iterative algorithm for the plant location problem, Qufu Shiyun Xuebao, 2 (1975), pp. 14-25 (in Chinese).
30. E. WEISZFELD, Sur le point par lequel le somme des distances de n points donnes est minimum, Tôhoku Math. J., 43 (1937), pp. 355-386.
31. G. L. XUE, Algorithms for Computing Extreme Points of Convex Hulls and the Euclidean Facilities Location Problem, Ph.D. thesis, Computer Science Department, University of Minnesota, Minneapolis, MN, 1991.
32. G. L. XUE, J. B. ROSEN, AND P. M. PARDALOS, A polynomial time dual algorithm for the Euclidean multifacility location problem, in Proceedings of Second Conference on Integer Programming and Combinatorial Optimization, Pittsburgh, PA, 1992, pp. 227-236.
33. Y. YE, Interior-point algorithms for quadratic programming, in Recent Developments in Mathematical Programming, S. Kumar, ed., Gordon and Breach, New York, 1991, pp. 237-262.