2024/05/03 by Goodwin, Ariel, Lewis, Adrian S., Lopez-Acedo, Genaro +1
#52A41 #57Z25 #65K05 #90C48 #F.2.1 #FOS: Mathematics #Optimization and Control (math.OC)
paper · doi:10.48550/arxiv.2405.01968
We consider geodesically convex optimization problems involving distances to a finite set of points A in a CAT(0) cubical complex. Examples include the minimum enclosing ball problem, the weighted mean and median problems, and the feasibility and projection problems for intersecting balls with centers in A. We propose a decomposition approach relying on standard Euclidean cutting plane algorithms. The cutting planes are readily derivable from efficient algorithms for computing geodesics in the complex.