Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Physarum Dynamics and Optimal Transport for Basis Pursuit (1812.11782v2)

Published 31 Dec 2018 in math.NA and cs.NA

Abstract: We study the connections between Physarum Dynamics and Dynamic Monge Kantorovich (DMK) Optimal Transport algorithms for the solution of Basis Pursuit problems. We show the equivalence between these two models and unveil their dynamic character by showing existence and uniqueness of the solution for all times and constructing a Lyapunov functional with negative Lie-derivative that drives the large-time convergence. We propose a discretization of the equation by means of a combination of implicit time-stepping and Newton method yielding an efficient and robust method for the solution of general basis pursuit problems. Several numerical experiments run on literature benchmark problems are used to show the accuracy, efficiency, and robustness of the proposed method.

Citations (13)

Summary

We haven't generated a summary for this paper yet.