Local convexity results in a generalized Fermat-Weber problem
| Autor: | Robert F. Love, Jack Brimberg |
|---|---|
| Rok vydání: | 1999 |
| Předmět: |
Fermat's Last Theorem
Hessian matrix Sublinear function Positive-definite matrix Weber problem Convexity Combinatorics Computational Mathematics symbols.namesake Computational Theory and Mathematics Fermat-Weber problem Modelling and Simulation Modeling and Simulation Convergence (routing) symbols Point (geometry) Convergence Mathematics |
| Zdroj: | Computers & Mathematics with Applications. 37:87-97 |
| ISSN: | 0898-1221 |
| DOI: | 10.1016/s0898-1221(99)00102-9 |
| Popis: | A generalized form of the Fermat-Weber problem requires finding a point in R N 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect