메뉴 건너뛰기




Volumn 10, Issue 3, 1998, Pages 219-242

A Newton acceleration of the Weiszfeld algorithm for minimizing the sum of Euclidean distances

Author keywords

Location problems; Newton methods; The Weiszfeld algorithm

Indexed keywords

EUCLIDEAN DISTANCES; LOCATION PROBLEM; NEWTON METHODS; THE WEISZFELD ALGORITHM;

EID: 0032114532     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1018333422414     Document Type: Article
Times cited : (14)

References (24)
  • 1
    • 0030304772 scopus 로고    scopus 로고
    • An efficient newton barrier method for minimizing a sum of Euclidean norms
    • to appear
    • K. D. Anderson, "An efficient newton barrier method for minimizing a sum of Euclidean norms," SIAM Journal on Optimization, (to appear).
    • SIAM Journal on Optimization
    • Anderson, K.D.1
  • 2
    • 0029194762 scopus 로고
    • The Fermat-Weber location problem revisited
    • J. Brimberg, "The Fermat-Weber location problem revisited," Mathematical Programming, 71, pp. 71-76, 1995.
    • (1995) Mathematical Programming , vol.71 , pp. 71-76
    • Brimberg, J.1
  • 3
    • 0001352404 scopus 로고
    • A stable algorithm for solving the multifacility location problem involving Euclidean distances
    • P. H. Calamai and A. R. Conn, "A stable algorithm for solving the multifacility location problem involving Euclidean distances," SIAM Journal on Scientific and Statistical Computing, vol. 1, pp. 512-526, 1980.
    • (1980) SIAM Journal on Scientific and Statistical Computing , vol.1 , pp. 512-526
    • Calamai, P.H.1    Conn, A.R.2
  • 6
    • 0000052888 scopus 로고
    • Open questions concerning Wiszfeld's algorithm for the Fermat-Weber location problem
    • R. Chandrasekaran and A. Tamir, "Open questions concerning Wiszfeld's algorithm for the Fermat-Weber location problem," Mathematical Programming, vol. 44, pp. 293-295, 1989.
    • (1989) Mathematical Programming , vol.44 , pp. 293-295
    • Chandrasekaran, R.1    Tamir, A.2
  • 9
    • 34249771074 scopus 로고
    • On the convergence of reflective Newton methods for large-scale nonlinear minimization subject to bounds
    • T. F. Coleman and Y. Li, "On the convergence of reflective Newton methods for large-scale nonlinear minimization subject to bounds," Mathematical Programming, vol. 67, pp. 189-224, 1994.
    • (1994) Mathematical Programming , vol.67 , pp. 189-224
    • Coleman, T.F.1    Li, Y.2
  • 11
    • 0016027631 scopus 로고
    • Local convergence in Fermat's problem
    • I. N. Katz, "Local convergence in Fermat's problem, Mathematical Programming, vol. 6, pp. 89-104, 1974.
    • (1974) Mathematical Programming , vol.6 , pp. 89-104
    • Katz, I.N.1
  • 12
    • 34250438259 scopus 로고
    • A note on Fermat's problem
    • H. W. Kuhn, "A note on Fermat's problem," Mathematical Programming, vol. 4, pp. 99-107, 1973.
    • (1973) Mathematical Programming , vol.4 , pp. 99-107
    • Kuhn, H.W.1
  • 15
    • 0010723307 scopus 로고
    • Link-length minimization in networks
    • E. Miehle, "Link-length minimization in networks," Operation Research, vol. 6, pp. 232-243, 1958.
    • (1958) Operation Research , vol.6 , pp. 232-243
    • Miehle, E.1
  • 17
    • 0003150632 scopus 로고
    • A quadratically convergent method for minimizing a sum of Euclidean norms
    • M. L. Overton, "A quadratically convergent method for minimizing a sum of Euclidean norms," Mathematical Programming, pp. 34-63, 1983.
    • (1983) Mathematical Programming , pp. 34-63
    • Overton, M.L.1
  • 18
    • 0000685126 scopus 로고
    • On scaled projections and pseudoinverse
    • G. W. Stewart, "On scaled projections and pseudoinverse," Linear Algebra and its Applications, vol. 112, pp. 189-193, 1989.
    • (1989) Linear Algebra and Its Applications , vol.112 , pp. 189-193
    • Stewart, G.W.1
  • 19
    • 0003753533 scopus 로고
    • The MathWorks: Natick, MA
    • The MathWorks Inc., Matlab Reference guide, The MathWorks: Natick, MA, 1992.
    • (1992) Matlab Reference Guide
  • 20
    • 0002665004 scopus 로고
    • Recent developments and new directions in linear programming
    • M. In and K. Tanabe, eds., Kluwer Academic Publishers: Boston
    • M. J. Todd, "Recent developments and new directions in linear programming," in M. In and K. Tanabe, eds., Mathematical Programming: Recent Developments and Applications, Kluwer Academic Publishers: Boston, 1989.
    • (1989) Mathematical Programming: Recent Developments and Applications
    • Todd, M.J.1
  • 21
    • 0022146092 scopus 로고
    • On the method of weighting for equality-constrained least squares problems
    • C. Van Loan, "On the method of weighting for equality-constrained least squares problems," SIAM Journal on Numerical Analysis, vol. 22, pp. 851-864, 1985.
    • (1985) SIAM Journal on Numerical Analysis , vol.22 , pp. 851-864
    • Van Loan, C.1
  • 22
    • 21844522941 scopus 로고
    • Stable numerical algorithm for equilibrium systems
    • S. Vavasis, "Stable numerical algorithm for equilibrium systems," SIAM J. Matrix Anal. Appl., vol. 15, pp. 1108-1131, 1994.
    • (1994) SIAM J. Matrix Anal. Appl. , vol.15 , pp. 1108-1131
    • Vavasis, S.1
  • 23
    • 0008520850 scopus 로고
    • Linear convergence of generalized Weiszfeld's method
    • H. Voss and U. Eckhardt, "Linear convergence of generalized Weiszfeld's method," Computing, vol. 25, pp. 243-251, 1980.
    • (1980) Computing , vol.25 , pp. 243-251
    • Voss, H.1    Eckhardt, U.2
  • 24
    • 0000281286 scopus 로고
    • Sur le point pour lequel la somme des distances de n points dennés est minimum
    • E. Weiszfeld, "Sur le point pour lequel la somme des distances de n points dennés est minimum," Tôhoko Mathematics Journal, vol. 43, pp. 355-386, 1937.
    • (1937) Tôhoko Mathematics Journal , vol.43 , pp. 355-386
    • Weiszfeld, E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.