skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Gangbo, W"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, ESAIM Control optimisation and calculus of variations)
    Accepted Manuscript Full Text Available
  2. ; ; (, Annales de l’Institut Henri Poincaré. C, Analyse non linéaire)
    This manuscript identifies a maximal system of equations which renders the classical Dar- boux problem elliptic, thereby providing a selection criterion for its well posedness. We establish uniqueness of factorization when the system is coupled with a Dirichlet datum. As a byproduct, we obtain, what we term symplectic decomposition of vector fields. 
    more » « less
    Accepted Manuscript Full Text Available
  3. ; ; ; ; (, Journal of scientific computing)
    We propose a new algorithm to approximate the Earth Mover's distance (EMD). Our main idea is motivated by the theory of optimal transport, in which EMD can be reformulated as a familiar L1 type minimization. We use a regularization which gives us a unique solution for this L1 type problem. The new regularized minimization is very similar to problems which have been solved in the fields of compressed sensing and image processing, where several fast methods are available. In this paper, we adopt a primal-dual algorithm designed there, which uses very simple updates at each iteration and is shown to converge very rapidly. Several numerical examples are provided. 
    more » « less
    Accepted Manuscript Full Text Available