{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T12:43:31Z","timestamp":1773319411198,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1023\/a:1013768901780","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T17:20:10Z","timestamp":1040664010000},"page":"213-229","source":"Crossref","is-referenced-by-count":9,"title":["The Newton Bracketing Method for Convex Minimization"],"prefix":"10.1007","volume":"21","author":[{"given":"Yuri","family":"Levin","sequence":"first","affiliation":[]},{"given":"Adi","family":"Ben-Israel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"390827_CR1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/978-1-4757-2878-1_2","volume-title":"New Trends in Mathematical Programming","author":"C. Antoni","year":"1998","unstructured":"C. Antoni and A. Dalena, New Trends in Mathematical Programming, Kluwer Acad. Publishers: Boston, 1998, pp. 5\u201312."},{"key":"390827_CR2","volume-title":"Nonlinear Programming","author":"D. Bertsekas","year":"1995","unstructured":"D. Bertsekas, Nonlinear Programming, Athena Scientific, Belmont, MA, 1995."},{"issue":"1","key":"390827_CR3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF01592245","volume":"71","author":"J. Brimberg","year":"1995","unstructured":"J. Brimberg, \u201cThe Fermat\u2014Weber location problem revisited,\u201d Math. Prog., vol. 71, no. 1 (Ser. A), pp. 71\u201376, 1995.","journal-title":"Math. Prog."},{"issue":"4\u20135","key":"390827_CR4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0167-6377(98)00016-9","volume":"22","author":"J. Brimberg","year":"1998","unstructured":"J. Brimberg, R. Chen, and D. Chen, \u201cAccelerating convergence in the Fermat\u2014Weber location problem,\u201d Oper. Res. Lett. vol. 22, no. 4\u20135, pp. 151\u2013157, 1998.","journal-title":"Oper. Res. Lett."},{"key":"390827_CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0898-1221(99)00102-9","volume":"37","author":"J. Brimberg","year":"1999","unstructured":"J. Brimberg and R.F. Love, \u201cLocal convexity results in a generalized Fermat\u2014Weber problem,\u201d Comput. Math. Appl., vol. 37, pp. 87\u201397, 1999.","journal-title":"Comput. Math. Appl."},{"issue":"3","key":"390827_CR6","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01587094","volume":"44","author":"R. Chandrasekaran","year":"1989","unstructured":"R. Chandrasekaran and A. Tamir, \u201cOpen questions concerning Weiszfeld's algorithm for the Fermat\u2014Weber location problem,\u201d Math. Prog., vol. 44, no. 3 (ser. A), pp. 293\u2013295, 1989.","journal-title":"Math. Prog."},{"issue":"2","key":"390827_CR7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01585739","volume":"46","author":"R. Chandrasekaran","year":"1990","unstructured":"R. Chandrasekaran and A. Tamir, \u201cAlgebraic optimization: The Fermat\u2014Weber location problem,\u201d Math. Prog., vol. 46, no. 2 (ser. A), pp. 219\u2013224, 1990.","journal-title":"Math. Prog."},{"key":"390827_CR8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01588972","volume":"14","author":"F. Cordellier","year":"1978","unstructured":"F. Cordellier and J.Ch. Fiorot, \u201cOn the Fermat\u2014Weber problem with convex cost functions,\u201d Math. Prog., vol. 14, pp. 295\u2013311, 1978.","journal-title":"Math. Prog."},{"key":"390827_CR9","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/trsc.18.4.351","volume":"18","author":"Z. Drezner","year":"1984","unstructured":"Z. Drezner, \u201cThe planar two\u2014center and two\u2014median problems,\u201d Transportation Sci., vol. 18, pp. 351\u2013361, 1984.","journal-title":"Transportation Sci."},{"key":"390827_CR10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF02060474","volume":"40","author":"Z. Drezner","year":"1992","unstructured":"Z. Drezner, \u201cA note on the Weber location problem,\u201d Ann. Oper. Res., vol. 40, pp. 153\u2013161, 1992.","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"390827_CR11","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0966-8349(96)00004-6","volume":"3","author":"Z. Drezner","year":"1995","unstructured":"Z. Drezner, \u201cA note on accelerating the Weiszfeld procedure,\u201d Location Sciences, vol. 3, no. 4, pp. 275\u2013279, 1995.","journal-title":"Location Sciences"},{"key":"390827_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/trsc.25.1.3","volume":"25","author":"Z. Drezner","year":"1991","unstructured":"Z. Drezner and A.J. Goldman, \u201cOn the set of optimal points to the Weber problem,\u201d Transportation Sci., vol. 25, pp. 3\u20138, 1991.","journal-title":"Transportation Sci."},{"key":"390827_CR13","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02060475","volume":"40","author":"Z. Drezner","year":"1992","unstructured":"Z. Drezner and D. Simchi-Levi, \u201cAsymptotic behavior of the Weber location problem on the plane,\u201d Ann. Oper. Res., vol. 40, pp. 163\u2013172, 1992.","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"390827_CR14","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/BF01588313","volume":"18","author":"U. Eckhardt","year":"1980","unstructured":"U. Eckhardt, \u201cWeber's problem andWeiszfeld's algorithm in general spaces,\u201d Math. Prog., vol. 18, no. 2, pp. 186\u2013196, 1980.","journal-title":"Math. Prog."},{"key":"390827_CR15","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1080\/05695558308974616","volume":"15","author":"J. Elzinga","year":"1983","unstructured":"J. Elzinga and D.W. Hearn, \u201cOn stopping rules for facilities location algorithm,\u201d IIE Transactions, vol. 15, pp. 81\u201383, 1983.","journal-title":"IIE Transactions"},{"key":"390827_CR16","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1002\/nav.3800310103","volume":"31","author":"H. Juel","year":"1984","unstructured":"H. Juel, \u201cOn a rational stopping rule for facilities location algorithms,\u201d Naval Res. Logist. Quart., vol. 31, pp. 9\u201311, 1984.","journal-title":"Naval Res. Logist. Quart."},{"issue":"2","key":"390827_CR17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02614441","volume":"76","author":"W. Kaplan","year":"1997","unstructured":"W. Kaplan and Wei H. Yang, \u201cDuality theorem for a generalized Fermat\u2014Weber problem,\u201d Math. Prog., vol. 76, no. 2 (Ser. A), pp. 285\u2013297, 1997.","journal-title":"Math. Prog."},{"key":"390827_CR18","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF01580224","volume":"6","author":"I.N. Katz","year":"1974","unstructured":"I.N. Katz, \u201cLocal convergence in Fermat's problem,\u201d Math. Prog., vol. 6, pp. 89\u2013104, 1974.","journal-title":"Math. Prog."},{"key":"390827_CR19","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1090\/S0002-9939-1953-0055639-3","volume":"4","author":"J. Kiefer","year":"1953","unstructured":"J. Kiefer, \u201cSequential minimax search for a maximum,\u201d Proc. Amer. Math. Soc., vol. 4, pp. 502\u2013506, 1953.","journal-title":"Proc. Amer. Math. Soc."},{"key":"390827_CR20","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/BF01584648","volume":"4","author":"H. Kuhn","year":"1973","unstructured":"H. Kuhn, \u201cA note on Fermat's problem,\u201d Math. Prog., vol. 4, pp. 98\u2013107, 1973.","journal-title":"Math. Prog."},{"key":"390827_CR21","first-page":"237","volume":"71","author":"Y. Levin","year":"2002","unstructured":"Y. Levin and A. Ben-Israel, \u201cDirectional Newton methods in n variables,\u201d Math. of Computation, vol. 71, pp. 237\u2013250, 2002.","journal-title":"Math. of Computation"},{"issue":"3","key":"390827_CR22","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1023\/A:1018333422414","volume":"10","author":"Y. Li","year":"1998","unstructured":"Y. Li, \u201cA Newton acceleration of the Weiszfeld algorithm for minimizing the sum of Euclidean distances,\u201d Comput. Optim. Appl., vol. 10, no. 3, pp. 219\u2013242, 1998.","journal-title":"Comput. Optim. Appl."},{"key":"390827_CR23","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/opre.37.4.653","volume":"37","author":"R. Love","year":"1989","unstructured":"R. Love and P.D. Dowling, \u201cA generalized bounding method for multifacility location models,\u201d Oper. Res., vol. 37, pp. 89\u2013104, 1989.","journal-title":"Oper. Res."},{"key":"390827_CR24","volume-title":"Facilities Location: Models and Methods","author":"R. Love","year":"1988","unstructured":"R. Love, J. Morris, and G. Wesolowsky, Facilities Location: Models and Methods, North-Holland: Amsterdam, 1988."},{"key":"390827_CR25","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1080\/05695558108974573","volume":"13","author":"R. Love","year":"1981","unstructured":"R. Love and W. Yeong, \u201cA stopping rule for facilities location algorithms,\u201d AIIE Transactions, vol. 13, pp. 357\u2013362, 1981.","journal-title":"AIIE Transactions"},{"key":"390827_CR26","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF02592080","volume":"39","author":"C. Michelot","year":"1987","unstructured":"C. Michelot and O. Lefebvre, \u201cA primal-dual algorithm for the Fermat\u2014Weber problem involving mixed gauges,\u201d Math. Prog., vol. 39, pp. 319\u2013335, 1987.","journal-title":"Math. Prog."},{"key":"390827_CR27","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1287\/opre.29.1.37","volume":"29","author":"J.G. Morris","year":"1981","unstructured":"J.G. Morris, \u201cConvergence of the Weiszfeld algorithm for Weber problems using a generalized distance function,\u201d Oper. Res., vol. 29, pp. 37\u201348, 1981.","journal-title":"Oper. Res."},{"key":"390827_CR28","doi-asserted-by":"crossref","first-page":"1180","DOI":"10.1287\/opre.27.6.1180","volume":"27","author":"J.G. Morris","year":"1979","unstructured":"J.G. Morris and W.A. Verdini, \u201cMinisum, l p distance location problems solved via a perturbed problem and Weiszfeld's algorithm,\u201d Oper. Res., vol. 27, pp. 1180\u20131188, 1979.","journal-title":"Oper. Res."},{"key":"390827_CR29","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/trsc.12.2.153","volume":"12","author":"L.M. Ostresh Jr.","year":"1978","unstructured":"L.M. Ostresh, Jr., \u201cConvergence and descent in the Fermat location problem,\u201d Transportation Sci., vol. 12, pp. 153\u2013164, 1978.","journal-title":"Transportation Sci."},{"key":"390827_CR30","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1287\/opre.26.4.597","volume":"26","author":"L.M. Ostresh Jr.","year":"1978","unstructured":"L.M. Ostresh, Jr., \u201cOn the convergence of a class of iterative methods for solving theWeber location problem,\u201d Oper. Res., vol. 26, pp. 597\u2013609, 1978.","journal-title":"Oper. Res."},{"key":"390827_CR31","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/BF02591963","volume":"27","author":"M.L. Overton","year":"1983","unstructured":"M.L. Overton, \u201cA quadratically convergent method for minimizing a sum of Euclidean norms,\u201d Math. Prog., vol. 27, pp. 34\u201363, 1983.","journal-title":"Math. Prog."},{"key":"390827_CR32","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF02242002","volume":"25","author":"H. Vo\u00df","year":"1980","unstructured":"H. Vo\u00df and U. Eckhardt, \u201cLinear convergence of generalized Weiszfeld's method,\u201d Computing, vol. 25, pp. 243\u2013251, 1980.","journal-title":"Computing"},{"key":"390827_CR33","first-page":"355","volume":"43","author":"E. Weiszfeld","year":"1937","unstructured":"E. Weiszfeld, \u201cSur le point per lequel la somme des distances de n points donn\u00e9s est minimum,\u201d Tohoku Math. J., vol. 43, pp. 355\u2013386, 1937.","journal-title":"Tohoku Math. J."},{"issue":"3","key":"390827_CR34","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1080\/02331939408843986","volume":"30","author":"S. Wu","year":"1994","unstructured":"S. Wu, \u201cA polynomial time algorithm for solving the Fermat\u2014Weber location problem with mixed norms,\u201d Optimization, vol. 30, no. 3, pp. 227\u2013234, 1994.","journal-title":"Optimization"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013768901780.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013768901780\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013768901780.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:14:05Z","timestamp":1752376445000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013768901780"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["390827"],"URL":"https:\/\/doi.org\/10.1023\/a:1013768901780","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}