An efficient algorithm for minimizing a sum of p-norms

SIAM Journal on Optimization

Volumn 10, Issue 2, 1999, Pages 551-579

  Xue, Guoliang ^a   Ye, Yinyu ^b  

^a University of Vermont   (United States)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

Facilities location; Minimizing a sum of norms; Polynomial time algorithms; Primal dual potential reduction algorithms; Shortest network under a given topology; Steiner minimum trees

Indexed keywords

EID: 0011032427     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/s1052623497327088     Document Type: Article

References (36)

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 continous multifacility location problem, in Numerical Analysis: Proceedings of the Ninth Biennial Conference, Dundee, Scotland, Lecture Notes in Mathematics 912, G.A. Watson, ed., Springer-Verlag, New York, 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. K.D. ANDERSON, E. CHRISTIANSEN, A.R. CONN, AND M.L. OVERTON, An efficient primal-dual intererior-point method for minimizing a sum of Euclidean norms, SIAM J. Sci. Comput., to appear.
8. D. DEN HERTOG, Interior Point Approach to Linear, Quadratic and Convex Programming, Kluwer Academic Publishers, Norwell, MA, 1994.
9. D. DEN HERTOG, F. JARRE, C. ROOS, AND T. TERLAKY, A sufficient condition for self-concordance, with application to some classes of structured convex programming problems, Math. Programming, 69 (1995), pp. 75-88.
10. 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.
11. R.L. FRANCIS, L.F. MCGINNIS, JR., AND J.A. WHITE, Facility Layout and Location: An Analytical Approach, Prentice-Hall, Englewood Cliffs, NJ, 1991.
12. M.R. GAREY, R.L. GRAHAM, AND D.S. JOHNSON, The complexity of computing Steiner minimal trees, SIAM J. Appl. Math., 32 (1977), pp. 835-859.
13. E.N. GILBERT AND H.O. POLLAK, Steiner minimal trees, SIAM J. Appl. Math., 16 (1968), pp. 1-29.
14. G.H. GOLUB AND C.F. VAN LOAN, Matrix Computations, The Johns Hopkins University Press, Baltimore, MD, 1983.
15. F.K. HWANG, A linear time algorithm for full Steiner trees, Oper. Res. Lett., 4 (1986), pp. 235-237.
16. F.K. HWANG AND J.F. WENG, The shortest network under a given topology, J. Algorithms, 13 (1992), pp. 468-488.
17. I.N. KATZ, Local convergence in Fermat's problem, Math. Programming, 6 (1974), pp. 89-104.
18. M. KOJIMA, S. SHINDOH AND S. HARA, Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices, Research Reports on Information Sciences, No. B-282, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Japan, 1994; revised April, 1995.
19. H.W. KUHN, A note on Fermat's problem, Math. Programming, 4 (1973), pp. 98-107.
20. Y. LI, A Newton Acceleration of the Weiszfeld Algorithm for Minimizing the Sum of Euclidean Distances, Technical report TR95-1552, Computer Science Department, Cornell University, Ithaca, NY, November 1995.
21. R.F. LOVE, J.G. MORRIS, AND G.O. WESOLOWSKY, Facilities Location: Models & Methods, North-Holland, Amsterdam, 1988.
22. Z.A. MELZAK, On the problem of Steiner, Canad. Math. Bull., 16 (1961), pp. 143-148.
23. W. MIEHLE, Link length minimization in networks, Oper. Res., 6 (1958), pp. 232-243.
24. A NEMIROVSKII, Polynomial time methods in convex programming, in The Mathematics of Numerical Analysis, Lectures in Applied Mathematics 32, J. Renegar, M. Shub, and S. Smale, eds., AMS, Providence, RI, 1996.
25. YU. NESTEROV AND A. NEMIROVSKII, Interior-Point Polynomial Algorithms in Convex Programming, SIAM Stud. Appl. Math. 13, SIAM, Philadelphia, PA, 1994.
26. YU. E. NESTEROV AND M. J. TODD, Self-scaled barriers and interior-point methods for convex programming, Math. Oper. Res. 22 (1997), pp. 1-42.
27. L.M. OSTRESH, The multifacility location problem: Applications and descent theorems, J. Regional Science, 17 (1977), pp. 409-419.
28. M.L. OVERTON, A quadratically convergent method for minimizing a sum of Euclidean norms, Math. Programming, 27 (1983), pp. 34-63.
29. 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.
30. 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.
31. W.D. SMITH, How to find Steiner minimal trees in Euclidean d-space, Algorithmica, 7 (1992), pp. 137-177.
32. 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).
33. E. WEISZFELD, Sur le point par lequel le somme des distances de n points donnes est minimum, Tohoku Math. J., 43 (1937), pp. 335-386.
34. 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, 1991.
35. 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, Pittsburg, PA, 1992, pp. 227-236.
36. G. XUE AND Y. YE, An efficient algorithm for minimizing a sum of Euclidean norms with applications, SIAM J. Optim., 7 (1997), pp. 1017-1036.