An algorithm for computing Fréchet means on the sphere

DOI10.1007/s11590-019-01415-yzbMath1430.90469arXiv1802.09243OpenAlexW2787983785WikidataQ125927194 ScholiaQ125927194MaRDI QIDQ2329671

Thomas Hotz, Gabriele Eichfelder, Johannes Wieditz

Publication date: 18 October 2019

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.09243

zbMATH Keywords

branch and boundglobal optimisationFréchet means

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Related Items (1)

Nonparametric regression in nonstandard spaces

Uses Software

• R

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics
• A stochastic algorithm finding generalized means on compact manifolds
• Means in metric spaces and the center of mass
• On the point for which the sum of the distances to \(n\) given points is minimum
• On means of distances on the surface of a sphere (lower bounds)
• The sum of the distances to N points on a sphere
• Intrinsic means on the circle: uniqueness, locus and asymptotics
• On the Convergence of Gradient Descent for Finding the Riemannian Center of Mass
• Riemannian $L^{p}$ center of mass: Existence, uniqueness, and convexity
• Statistical Analysis of Spherical Data
• Direction Estimation by Minimum Squared Arc Length
• Means in complete manifolds: uniqueness and approximation

This page was built for publication: An algorithm for computing Fréchet means on the sphere