A primal-dual level set method for computing geodesic distances

DOI10.1137/24M1721086MaRDI QIDQ6858921zbMATH OpenFDO

Authors Hailiang Liu, Laura Zinnel

Publication date 12 February 2026

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/24M1721086

zbMATH Keywords

convergencegeodesiclevel setprimal-dual

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Numerical mathematical programming methods (65K05)

Cites work

• A first-order primal-dual algorithm for convex problems with applications to imaging
• A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
• Accelerated variational PDEs for efficient solution of regularized inversion problems
• Approximating geodesics via random points
• Complex geodesics in de Sitter space
• Computing geodesic paths on manifolds
• Convex Analysis
• Differential geometry
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces
• scientific article; zbMATH DE number 1510303 (Why is no real title available?)
• Level set methods and dynamic implicit surfaces
• Motion of curves constrained on surfaces using a level-set approach
• PDE acceleration: a convergence rate analysis and applications to obstacle problems
• The Discrete Geodesic Problem
• The Split Bregman Method for L1-Regularized Problems
• Uniform convergence rates for Lipschitz learning on graphs

This page was built for publication: A primal-dual level set method for computing geodesic distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858921)