output
20022014
most citedInferring population history with DIYABC: a user-friendly approach to Approximate Bayesian Computation

688 citations

Showing 2010 · math.OCShow all

6 papers · 2 filters

math.OC2010

Asymptotic Properties of Optimal Trajectories in Dynamic Programming

Sylvain Sorin, Xavier Venel, Guillaume Vigeral

We prove in a dynamic programming framework that uniform convergence of the finite horizon values implies that asymptotically the average accumulated payoff is constant on optimal…

math.OC2010

About Hölder-regularity of the convex shape minimizing λ2

Jimmy Lamboley

In this paper, we consider the well-known following shape optimization problem: where $λ_2(\Om)$ denotes the seco…

math.OC2010

On the strategic use of risk and undesirable goods in multidimensional screening

Aimé Lachapelle, Filippo Santambrogio

A monopolist sells goods with possibly a characteristic consumers dislike (for instance, he sells random goods to risk averse agents), which does not affect the production costs. W…

math.OC2010

Analysis of the Toolkit method for the time-dependant Schrödinger equation

Lucie Baudouin, Julien Salomon, Gabriel Turinici

The goal of this paper is to provide an analysis of the "toolkit" method used in the numerical approximation of the time-dependent Schrödinger equation. The "toolkit" method is bas…

math.OC20105 cited

A uniform Tauberian theorem in optimal control

Miquel Oliu-Barton, Guillaume Vigeral

In an optimal control framework, we consider the value of the problem starting from state with finite horizon , as well as the value of the -discounted…

math.OC2010

A Benamou-Brenier approach to branched transport

Lorenzo Brasco, Giuseppe Buttazzo, Filippo Santambrogio

The problem of branched transportation aims to describe the movement of masses when, due to concavity effects, they have the interest to travel together as much as possible, becaus…