An optimal L1-minimization algorithm for stationary Hamilton-Jacobi equations Academic Article uri icon


  • We describe an algorithm for solving steady one-dimensional convex-like Hamilton-Jacobi equations using a L1-minimization technique on piecewise linear approximations. For a large class of convex Hamiltonians, the algorithm is proven to be convergent and of optimal complexity whenever the viscosity solution is q-semiconcave. Numerical results are presented to illustrate the performance of the method. 2009 International Press.

published proceedings

  • Communications in Mathematical Sciences

author list (cited authors)

  • Guermond, J., & Popov, B.

citation count

  • 4

complete list of authors

  • Guermond, Jean-Luc||Popov, Bojan

publication date

  • January 2009