TY - EJOUR
DO - 10.1007/s00211-010-0305-8
AB - This paper introduces a subgradient descent algorithm to compute a Riemannian metric that minimizes an energy involving geodesic distances. The heart of the method is the Subgradient Marching Algorithm to compute the derivative of the geodesic distance with respect to the metric. The geodesic distance being a concave function of the metric, this algorithm computes an element of the subgradient in O(N (2) log(N)) operations on a discrete grid of N points. It performs a front propagation that computes a subgradient of a discrete geodesic distance. We show applications to landscape modeling and to traffic congestion. Both applications require the maximization of geodesic distances under convex constraints, and are solved by subgradient descent computed with our Subgradient Marching. We also show application to the inversion of travel time tomography, where the recovered metric is the local minimum of a non-convex variational problem involving geodesic distances.
T1 - Derivatives with respect to metrics and applications: subgradient marching algorithm
DA - 2010
AU - Benmansour, F.
AU - Carlier, G.
AU - Peyre, G.
AU - Santambrogio, F.
JF - Numerische Mathematik
SP - 357-381
VL - 116
EP - 357-381
ID - 172406
KW - Hamilton-Jacobi Equations
KW - Travel-Time Tomography
KW - Traffic Congestion
KW - Equilibria
ER -