Skip to Main content Skip to Navigation
Journal articles

Derivatives with respect to metrics and applications: Subgradient Marching Algorithm

Abstract : This paper describes 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(N2 log(N)) operations on a discrete grid of N points. It performs a front propagation that computes the subgradient of a discrete geodesic distance. Equipped with this Subgradient Marching, a Riemannian metric can be designed through an optimization process. 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
Complete list of metadata
Contributor : Filippo Santambrogio <>
Submitted on : Thursday, February 12, 2009 - 5:44:41 PM
Last modification on : Tuesday, December 8, 2020 - 10:32:53 AM
Long-term archiving on: : Friday, October 12, 2012 - 11:45:15 AM


Files produced by the author(s)


  • HAL Id : hal-00360971, version 1



Fethallah Benmansour, Guillaume Carlier, Gabriel Peyré, Filippo Santambrogio. Derivatives with respect to metrics and applications: Subgradient Marching Algorithm. Numerische Mathematik, Springer Verlag, 2010, 116 (3), pp.357-381. ⟨hal-00360971⟩



Record views


Files downloads