Local critical analysis of inequalities related to the sum of distances between \(n\) points on the unit hemisphere for \(n=4,5\) (Q6144991)

In the paper, the authors investigate the global optimization problem related to how to place \(n =4, 5\) points on a unit hemisphere so that the sum of the distances between \(n\) points is maximal. They introduce a two-stage method in which the first stage is to reduce the search space to relatively small neighborhoods of local optimal configurations via numerical computation, and the second stage is to prove that in specific small neighborhoods of the local optimal configuration, the given optimal configuration is the unique solution of the original problem. Applying symbolic computation, they prove that \((0, -1, 0)\), \((1, 0, 0)\), \((0, 1, 0)\), \((-1, 0, 0)\) form a local optimal solution for four points on the hemisphere and determine the required neighborhoods. For five points on the hemisphere, the authors prove that the regular pentagon inscribed to the equator is a local optimal solution and construct the neighborhoods where the regular pentagon is the unique solution.