The Newton Bracketing method for convex minimization

Computational Optimization and Applications

Volumn 21, Issue 2, 2002, Pages 213-229

  Levin, Yuri ^a   Ben Israel, Adi ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Convex functions; Directional Newton method; Fermat Weber location problem; Unconstrained minimization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; ITERATIVE METHODS;

CONVEX MINIMIZATION; DIRECTIONAL NEWTON METHOD;

OPTIMIZATION;

EID: 0036472199     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013768901780     Document Type: Article

References (34)

1. The Fermat-Weber location problem revisited
2. Accelerating convergence in the Fermat-Weber location problem
3. Local convexity results in a generalized Fermat-Weber problem
4. Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
5. Algebraic optimization: The Fermat-Weber location problem
6. On the Fermat-Weber problem with convex cost functions
7. The planar two-center and two-median problems
8. A note on the Weber location problem
9. A note on accelerating the Weiszfeld procedure
10. On the set of optimal points to the Weber problem
11. Asymptotic behavior of the Weber location problem on the planet
12. Weber's problem and Weiszfeld's algorithm in general spaces
13. On stopping rules for facilities location algorithm
14. On a rational stopping rule for facilities location algorithms
15. Duality theorem for a generalized Fermat-Weber problem
16. Local convergence in Fermat's problem
17. Sequential minimax search for a maximum
18. A note on Fermat's problem
19. Directional Newton methods in n variables
20. A Newton acceleration of the Weiszfeld algorithm for minimizing the sum of Euclidean distances
21. A generalized bounding method for multifacility location models
22. A stopping rule for facilities location algorithms
23. A primal-dual algorithm for the Fermat-Weber problem involving mixed gauges
24. Convergence of the Weiszfeld algorithm for Weber problems using a generalized distance function
25. p distance location problems solved via a perturbed problem and Weiszfeld's algorithm
26. Convergence and descent in the Fermat location problem
27. On the convergence of a class of iterative methods for solving the Weber location problem
28. A quadratically convergent method for minimizing a sum of Euclidean norms
29. Linear convergence of generalized Weiszfeld's method
30. Sur le point per lequel la somme des distances de n points donnés est minimum
31. A polynomial time algorithm for solving the Fermat-Weber location problem with mixed norms