Local convexity results in a generalized Fermat-Weber problem
โ Scribed by J. Brimberg; R.F. Love
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 646 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
โฆ Synopsis
A generalized form of the Fermat-Weber problem requires finding a point in R ~ to minimize a sum of nondecreasing functions of distances to m given points. In this paper, local convexity properties are investigated for the generalized problem. Sufficient conditions are derived which guarantee that the Hessian matrix of the objective function will be positive definite. The analysis also reveals that Weiszfeld-type iterative algorithms may have sublinear convergence rates, since the Hessian may only be positive semidefinite at a local minimum.
๐ SIMILAR VOLUMES
ln this note, a general existence theorem of generalized variational inequalities for quasi-monotone set-valued mappings in locally convex topological vector spaces has been established. Our result includes corresponding results in recent literature as special cases.