DeepAI AI Chat
Log In Sign Up

An algorithm for computing Fréchet means on the sphere

by   Gabriele Eichfelder, et al.
The University of Göttingen
TU Ilmenau

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.


page 1

page 2

page 3

page 4


A conditional bound on sphere tangencies in all dimensions

We use polynomial method techniques to bound the number of tangent pairs...

A simulated annealing procedure based on the ABC Shadow algorithm for statistical inference of point processes

Recently a new algorithm for sampling posteriors of unnormalised probabi...

Fast Tensor Needlet Transforms for Tangent Vector Fields on the Sphere

This paper constructs a semi-discrete tight frame of tensor needlets ass...

On taxicab distance mean functions and their geometric applications: methods, implementations and examples

A distance mean function measures the average distance of points from th...

Voronoi Diagrams of Arbitrary Order on the Sphere

For a given set of points U on a sphere S, the order k spherical Voronoi...

Distributed filtered hyperinterpolation for noisy data on the sphere

Problems in astrophysics, space weather research and geophysics usually ...

Optimization on the Surface of the (Hyper)-Sphere

Thomson problem is a classical problem in physics to study how n number ...