Horoballs and the subgradient method

arXiv:2403.15749v1 Announce Type: cross
Abstract: To explore convex optimization on Hadamard spaces, we consider an iteration in the style of a subgradient algorithm. Traditionally, such methods assume that the underlying spaces are manifolds and that the objectives are geodesically convex: the methods are described using tangent spaces and exponential maps. By contrast, our iteration applies in a general Hadamard space, is framed in the underlying space itself, and relies instead on horospherical convexity of the objective level sets. For this …

abstract algorithm arxiv contrast cs.cc cs.lg explore iteration maps math.oc optimization spaces style type