相关论文: Settling the relationship between Wilber's bounds …

We provide a new proof of the known partial regularity result for the optimal transportation map (Brenier map) between two sets. Contrary to the existing regularity theory for the Monge-Amp{\`e}re equation, which is based on the maximum…

Consider a convex function that is invariant under an group of transformations. If it has a minimizer, does it also have an invariant minimizer? Variants of this problem appear in nonparametric statistics and in a number of adjacent fields.…

In this paper we give a comprehensive treatment of a two-penalty boundary obstacle problem for a divergence form elliptic operator, motivated by applications to fluid dynamics and thermics. Specifically, we prove existence, uniqueness and…

The movement of data (communication) between levels of a memory hierarchy, or between parallel processors on a network, can greatly dominate the cost of computation, so algorithms that minimize communication are of interest. Motivated by…

We numerically investigate the dynamics of orbits in 3D circumbinary phase-space as a function of binary eccentricity and mass fraction. We find that inclined circumbinary orbits in the elliptically-restricted three-body problem display a…

We study variational obstacle avoidance problems on complete Riemannian manifolds and apply the results to the construction of piecewise smooth curves interpolating a set of knot points in systems with impulse effects. We derive the…

Robust optimization is a popular paradigm for modeling and solving two- and multi-stage decision-making problems affected by uncertainty. In many real-world applications, the time of information discovery is decision-dependent and the…

In this paper, we revisit the question of how the dynamic optimality of search trees should be defined in external memory. A defining characteristic of external-memory data structures is that there is a stark asymmetry between queries and…

We study the martingale optimal transport problem with state-dependent trading frictions and develop a geometric and duality framework extending from the one time-step to the multi-marginal setting. Building on the left-monotone structure…

We study the output tracking problem for a vertically driven drill string system described by a nonlinear boundary-coupled PDE-ODE model. Solvability analysis of the drill string model is achieved by first casting the model in an abstract…

This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…

We consider the problem of collaborative tree exploration posed by Fraigniaud, Gasieniec, Kowalski, and Pelc where a team of $k$ agents is tasked to collectively go through all the edges of an unknown tree as fast as possible. Denoting by…

The contraction cost of a tensor network depends on the contraction order. However, the optimal contraction ordering problem is known to be NP-hard. We show that the linear contraction ordering problem for tree tensor networks admits a…

Our first result is a statement of a somewhat general form of a non-substitution theorem for linear programming problems, along with a very easy proof of the same. Subsequently, we provide an easy proof of theorem 1 in a 1979 paper of Olvi…

We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (globally) a discrete energy involving mean curvature. Although we…

The classical Euler's problem on stationary configurations of elastic rod with fixed endpoints and tangents at the endpoints is considered as a left-invariant optimal control problem on the group of motions of a two-dimensional plane…

In this paper, we study dynamic regret in unconstrained online convex optimization (OCO) with movement costs. Specifically, we generalize the standard setting by allowing the movement cost coefficients $\lambda_t$ to vary arbitrarily over…

We consider the problem of optimal partition of a domain with respect to the sum of the principal eigenvalues and we prove for the first time regularity results for the free interface up to fixed boundary. All our results are quantitative…

We study the mixing time of the single-site update Markov chain, known as the Glauber dynamics, for generating a random independent set of a tree. Our focus is obtaining optimal convergence results for arbitrary trees. We consider the more…

The tree share structure proposed by Dockins et al. is an elegant model for tracking disjoint ownership in concurrent separation logic, but decision procedures for tree shares are hard to implement due to a lack of a systematic theoretical…