Search arXivSearch

arXiv · 2502.05683

Localisation for the second-order Beckmann problem: bimartingale couplings and leaf decompositions

Abstract

We develop a second-order localisation theory for optimal transport based on leaf decompositions and bimartingale couplings. It provides a second-order analogue of the classical decomposition of optimal transport into transport rays and monotone couplings: transport rays are replaced by the leaves of the $1$-Lipschitz derivative map $Du$ of an optimal dual potential $u\in C^{1,1}(\mathbb R^n)$, while monotone couplings are replaced by bimartingale couplings. We apply this framework to the three-marginal optimal transport problem introduced by Bolbotowski and Bouchitté, whose relaxation is the second-order Beckmann problem. We introduce bimartingale couplings and characterise their existence through a convex-concave order condition. This yields a generalisation of Strassen's theorem from convex order to the convex-concave setting. Equivalently, the dual problem associated with the second-order Beckmann problem admits an optimiser whose derivative is an isometry. For absolutely continuous measures with common barycentre, assuming the existence of an optimal plan with absolutely continuous third marginal, we prove that every optimal plan decomposes into a family of problems on the leaves of $Du$. On each leaf, all optimal plans are completely described by bimartingale couplings between the corresponding conditional measures. Without this absolute continuity assumption, we show that the leaf decomposition persists in a more general form: optimal plans are mixtures of plans concentrated on triples $(x,y,z)$ satisfying $x\in \mathcal{S}_1$, $y\in \mathcal{S}_2$, and $z\in \mathcal{S}_1\cap \mathcal{S}_2$, where $\mathcal{S}_1$ and $\mathcal{S}_2$ are neighbouring leaves of $Du$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Krzysztof J. Ciosmak. 2026-07-18. Localisation for the second-order Beckmann problem: bimartingale couplings and leaf decompositions. https://arxiv.org/abs/2502.05683

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Dynamic Programming-Compatible Uncertainty Sets in Robust Markov Decision Processes

In this paper, we investigate the compatibility of robust Markov Decision Processes (RMDPs) with dynamic programming under various assumptions on the uncertainty set, i.e., we investigate when one can solve an RMDP by solving a fixed point equation. We show that in all generality, s-rectangular and sa-rectangular uncertainty sets are the only models of uncertainty that are compatible with dynamic programming. Our analysis shows that existing non-rectangular models, including r-rectangularity, are only weakly compatible with dynamic programming, as they require the assumption that rewards do not depend on the next state. In this case, our results imply that one can always construct a rectangular uncertainty set that is equivalent, for both policy evaluation and optimization, to the dynamic programming-compatible non-rectangular model. This highlights a key limitation: dynamic-programming-compatible non-rectangular uncertainty sets, although practically relevant for uncertainty quantification, do not provide a genuinely distinct assessment of policy performance. Interestingly, our proof techniques rely on identifying a novel simultaneous solvability property, which we show is central to several important properties of RMDPs, including the existence of stationary optimal policies and dynamic programming-based formulations. The simultaneous solvability property enables a unified approach to studying all existing models of uncertainty, rectangular and non-rectangular alike.

math.OC

A simple and practical adaptive trust-region method

We present an adaptive trust-region method for unconstrained optimization that allows inexact solutions to the trust-region subproblems. Our method is a simple variant of the classical trust-region method of Ssorensen. The method achieves the best possible convergence bound up to an additive logarithmic term for finding an $ε$-approximate stationary point, i.e., $O( Δ_f L^{1/2} ε^{-3/2}) + \tilde{O}(1)$ iterations, where $L$ is the Lipschitz constant of the Hessian, $Δ_f$ is the optimality gap, and $ε$ is the termination tolerance for the gradient norm. This improves over existing trust-region methods whose worst-case bound is at least a factor of $L$ worse. We compare our performance with state-of-the-art trust-region (TRU) and cubic regularization (ARC) methods from the GALAHAD library on the CUTEst benchmark problems with at least 100 variables. We also compare with the recently developed Universal trust-region (UTR) method, using the same subproblem solver. In terms of shifted geometric mean of wall-clock times our method's is between $1.2\times$ and $2\times$ faster. We report similar improvements for number of function evaluations, factorizations, gradient evaluations and Hessian evaluations. Compared to the conference version of this paper, our revised method includes several practical enhancements. These modifications dramatically improved performance, including almost an order of magnitude reduction in the shifted geometric mean of wall-clock times. We also show that it suffices for the function to be continuously twice-differentiable to guarantee that either the minimum gradient norm converges to zero or the objective value tends towards negative infinity, even when the iterates diverge.

math.OC

Rough Stochastic Pontryagin Maximum Principle and an Indirect Shooting Method

We derive first-order Pontryagin optimality conditions for stochastic optimal control with deterministic controls for systems modeled by rough differential equations (RDE) driven by Gaussian rough paths. This Pontryagin Maximum Principle (PMP) applies to systems following stochastic differential equations (SDE) driven by Brownian motion, yet it does not rely on forward-backward SDEs and involves the same Hamiltonian as the deterministic PMP. The proof consists of first deriving various integrable error bounds for solutions to nonlinear and linear RDEs by leveraging recent results on Gaussian rough paths. The PMP then follows using standard techniques based on needle-like variations. As an application, we propose the first indirect shooting method for nonlinear stochastic optimal control and show that it converges 10x faster than a direct method on a stabilization task.

math.OC