Algorithm to find point of minimum total distance from locations

Question

I\'m building an application based around finding a \"convenient meeting point\" given a set of locations.

Currently I\'m defining \"convenient\" as \"minimising the

Answer 1

One option is to define an objective (and gradient) function and use a generic optimization library, such as scipy.optimize. fmin_cg would be a good algorithm to try for your problem. Your objective would be the sum of distances as defined in the "Definition" section of the Geometric median Wikipedia page referenced by hatchet. The argument to your objective function is y.