Abstract
For most optimisation methods an essential assumption is the vector space structure of the feasible set. This condition is not fulfilled if we consider optimisation problems over the sphere. We present an algorithm for solving a special global problem over the sphere, namely the determination of Fréchet means, which are points minimising the mean distance to a given set of points. The Branch and Bound method derived needs no further assumptions on the input data, but is able to cope with this objective function which is neither convex nor differentiable. The algorithm’s performance is tested on simulated and real data.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Absil, P.A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2007)
Afsari, B.: Riemannian \(l^p\) center of mass: existence, uniqueness, and convexity. Proc. Am. Math. Soc. 139(2), 655–673 (2011)
Afsari, B., Tron, R., Vidal, R.: On the convergence of gradient descent for finding the Riemannian center of mass. SIAM J. Control Optim. 51(3), 2230–2260 (2013)
Arnaudon, M., Miclo, L.: Means in complete manifolds: uniqueness and approximation. ESAIM Probab. Stat. 18, 185–206 (2014)
Arnaudon, M., Miclo, L., et al.: A stochastic algorithm finding \( p \)-means on the circle. Bernoulli 22(4), 2237–2300 (2016)
Eichfelder, G., Gerlach, T., Sumi, S.: A modification of the \(\alpha \)bb method for box-constrained optimization and an application to inverse kinematics. EURO J. Comput. Optim. 4(1), 93–121 (2016)
Fisher, N.I., Lewis, T., Embleton, B.J.J.: Statistical Analysis of Spherical Data. Cambridge University Press, Cambridge (1987)
Fletcher, P.T., Venkatasubramanian, S., Joshi, S.: Robust statistics on Riemannian manifolds via the geometric median. In: IEEE Conference on Computer Vision and Pattern Recognition, 2008, CVPR 2008. pp. 1–8. IEEE (2008)
Hotz, T., Huckemann, S.: Intrinsic means on the circle: uniqueness, locus and asymptotics. Ann. Inst. Stat. Math. 67(1), 177–193 (2015)
Locatelli, M., Schoen, F.: Global Optimization: Theory, Algorithms, and Applications. MOS-SIAM Series on Optimization, vol. 15. SIAM, Philadelphia (2013)
Mardia, K.V., Jupp, P.E.: Directional Statistics. Wiley, New York (2000)
McKilliam, R.G., Quinn, B.G., Clarkson, I.V.L.: Direction estimation by minimum squared arc length. IEEE Trans. Signal Process. 60(5), 2115–2124 (2012)
Pálfia, M.: Means in metric spaces and the center of mass. J. Math. Anal. Appl. 381(1), 383–391 (2011)
R Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2016)
Stolarsky, K.: The sum of the distances to n points on a sphere. Pac. J. Math. 57(2), 563–573 (1975)
Wagner, G.: On means of distances on the surface of a sphere (lower bounds). Pac. J. Math. 144(2), 389–398 (1990)
Weiszfeld, E., Plastria, F.: On the point for which the sum of the distances to n given points is minimum. Ann. Oper. Res. 167(1), 7–41 (2009)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Eichfelder, G., Hotz, T. & Wieditz, J. An algorithm for computing Fréchet means on the sphere. Optim Lett 13, 1523–1533 (2019). https://doi.org/10.1007/s11590-019-01415-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-019-01415-y