An algorithm for computing Fréchet means on the sphere

DOI10.1007/S11590-019-01415-YMaRDI QIDQ2329671zbMATH OpenOpenAlexWikidataFDO

Authors Gabriele Eichfelder, Thomas Hotz, 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 boundFréchet meansglobal optimisation

Mathematics Subject Classification ID

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

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'echet 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.

Recommendations

• Minimax and maximin facility location problems on a sphere
• Behavior of the Fréchet mean and central limit theorems on spheres
• Concepts and techniques of optimization on the sphere
• A Solution to the Weber Location Problem on the Sphere
• An algorithm for continuous type optimal spherical facility location problem

Cites work

• A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics
• Direction Estimation by Minimum Squared Arc Length
• Global optimization. Theory, algorithms, and applications
• scientific article; zbMATH DE number 1375577 (Why is no real title available?)
• scientific article; zbMATH DE number 5223994 (Why is no real title available?)
• Intrinsic means on the circle: uniqueness, locus and asymptotics
• Means in complete manifolds: uniqueness and approximation
• Means in metric spaces and the center of mass
• On means of distances on the surface of a sphere (lower bounds)
• On the convergence of gradient descent for finding the Riemannian center of mass
• On the point for which the sum of the distances to n given points is minimum
• Riemannian \(L^{p}\) center of mass: existence, uniqueness, and convexity
• Statistical Analysis of Spherical Data
• The sum of the distances to N points on a sphere

Cited in

(8)

• Efficient and accurate computation of spherical mean values at scattered center points
• Nonparametric regression in nonstandard spaces
• Behavior of the Fréchet mean and central limit theorems on spheres
• Recursive Computation of the Fréchet Mean on Non-positively Curved Riemannian Manifolds with Applications
• scientific article; zbMATH DE number 880231 (Why is no real title available?)
• Necessary and sufficient condition for the existence of a Fréchet mean on the circle
• Fréchet mean set estimation in the Hausdorff metric, via relaxation
• SLERP-TVDRK (STVDRK) methods for ordinary differential equations on spheres

Describes a project that uses

Uses Software

• R

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329671)