A smoothing newton method for minimizing a sum of Euclidean norms

SIAM Journal on Optimization

Volumn 11, Issue 2, 2000, Pages 389-410

  Qi, Liqun ^a,b   Zhou, Guanglu ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Euclidean facilities location; Semismoothness; Shortest networks; Smoothing Newton method; Steiner minimum trees; Sum of norms

Indexed keywords

EID: 0034353738     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S105262349834895X     Document Type: Article

References (38)

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, Minimizing a sum of norms subject to linear equality constraints, Comput. Optim. Appl., 11 (1998), pp. 65-79.
3. K. D. ANDERSEN, E. CHRISTIANSEN, A. R. CONN, AND M. L. OVERTON, An efficient primal-dual interior-point method for minimizing a sum of Euclidean norms, SIAM J. Sci. Comput., 22 (2000), pp. 243-262.
4. P. H. CALAMAI AND A. R. CONN, A stable algorithm for solving the multifacility location problem involving Euclidean distances, SIAM J. Sci. Statist. Comput., 1 (1980), pp. 512-526.
5. p norm location problems, Math. Programming, 38 (1987), pp. 75-109.
6. R. CHANDRASEKARAN AND A. TAMIR, Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem, Math. Programming, 44 (1989), pp. 293-295.
7. R. CHANDRASEKARAN AND A. TAMIR, Algebraic optimization: The Fermat-Weber location problem, Math. Programming, 46 (1990), pp. 219-224.
8. 0 NCP or monotone NCP, SIAM J. Optim., 9 (1999), pp. 624-645.
9. C. CHEN AND O. L. MANGASARIAN, A class of smoothing functions for nonlinear and mixed complementarity problems, Comput. Optim. Appl., 5 (1996), pp. 97-138.
10. X. CHEN, L. QI, AND D. SUN, Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities, Math. Comp., 67 (1998), pp. 519-540.
11. X. CHEN AND Y. YE, On homotopy-smoothing methods for box-constrained variational inequalities, SIAM J. Control Optim., 37 (1999), pp. 589-616.
12. F. H. CLARKE, Optimization and Nonsmooth Analysis, John Wiley, New York, 1983.
13. J. W. EYSTER, J. A. WHITE, AND W. W. WIERWILLE, On solving multifacility location problems using a hyperboloid approximation procedure, AIIE Trans., 5 (1973), pp. 1-6.
14. T. DE LUCA, F. FACCHINEI, AND C. KANZOW, A semismooth equation approach to the solution of nonlinear complementarity problems, Math. Programming, 75 (1996), pp. 407-439.
15. F. FACCHINEI AND C. KANZOW, A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems, Math. Programming, 76 (1997), pp. 493-512.
16. A. FISCHER, Solution of monotone complementarity problems with locally Lipschitzian functions, Math. Programming, 76 (1997), pp. 513-532.
17. E. N. GILBERT AND H. O. POLLAK, Steiner minimal trees, SIAM J. Appl. Math., 16 (1968), pp. 1-29.
18. L. GRIPPO, F. LAMPARIELLO, AND S. LUCIDI, A nonmonotone line search technique for Newton's method, SIAM J. Numer. Anal., 23 (1986), pp. 707-716.
19. H. JIANG, Smoothed Fischer-Burmeister Equation Methods for the Complementarity Problem, Department of Mathematics, The University of Melbourne, Victoria, Australia, Preprint, 1997.
20. K. HOTTA AND A. YOSHISE, Global convergence of a class of non-interior-point algorithms using Chen-Harker-Kanzow functions for nonlinear complementarity problems, Math. Programming, 86 (1999), pp. 105-133.
21. H. JIANG AND L. QI, A new nonsmooth equations approach to nonlinear complementarity problems, SIAM J. Control Optim., 35 (1997), pp. 178-193.
22. H. W. KUHN, A note on Fermat's problem, Math. Programming, 4 (1973), pp. 98-107.
23. R. F. LOVE, J. G. MORRIS, AND G. O. WESOLOWSKY, Facility Location: Models and Methods, North-Holland, Amsterdam, 1988.
24. L. M. M. OSTRESH, The multifacility location problem: Applications and decent theorems, Journal of 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. 0-functions, SIAM J. Optim., 10 (2000), pp. 315-330.
27. L. QI, Convergence analysis of some algorithms for solving nonsmooth equations, Math. Oper. Res., 18 (1993), pp. 227-244.
28. L. QI, D. SUN, AND G. ZHOU, A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities, Math. Programming, 87 (2000), pp. 1-35.
29. L. QI AND J. SUN, A nonsmooth version of Newton's method, Math. Programming, 58 (1993), pp. 353-367.
30. 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.
31. 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.
32. D. SUN, A regularization Newton method for solving nonlinear complementarity problems, Appl. Math. Optim., 40 (1999), pp. 315-339.
33. C. Y. WANG ET AL, On the convergence and rate of convergence of an iterative algorithm for the plant location problem, Qufu Shifan Xuebao, 2 (1975), pp. 14-25 (in Chinese).
34. E. WEISZFELD, Sur le point par lequel la somme des distances de n points donnes est minimum, Tohoku Math. J., 43 (1937), pp. 355-386.
35. 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.
36. G. XUE AND Y. YE, An efficient algorithm for minimizing a sum of p-norms, SIAM J. Optim., 10 (2000), pp. 551-579.
37. N. YAMASHITA AND M. FUKUSHIMA, Modified Newton methods for solving semismooth reformulations of monotone complementarity problems, Math. Programming, 76 (1997), pp. 273-284.
38. G. ZHOU, D. SUN, AND L. QI, Numerical experiments for a class of squared smoothing Newton methods for box constrained variational inequality problems, in Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, Appl. Optim. 22, M. Fukushima and L. QI, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 1999, pp. 421-441.