Proximal Point Method on Finslerian Manifolds and the "Effort-Accuracy" Trade-off
Abstract
In this paper, we consider minimization problems with constraints. We show that, if the set of constraints is a Finslerian manifold of non-positive flag curvature, and the objective function is differentiable and satisfies the Kurdyka-Lojasiewicz property, then the proximal point method can be naturally extended to solve this class of problems. We prove that the sequence generated by our method is well defined and converges to a critical point. We show how tools of Finslerian geometry, specifically non-symmetrical metrics, can be used to solve non-convex constrained problems in Euclidean spaces. As an application, we give one result regarding decision-making speed and costs related to change.