Discrete Convex Functions on Graphs and Their Algorithmic Applications

The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by combinatorial dualities in multiflow problems and the complexity classification of facility location problems on graphs. We outline the theory and algorithmic applications in combinatorial optimization problems

Standard finite elements for the numerical resolution of the elliptic Monge-Ampere equation: Aleksandrov solutions

We prove a convergence result for a natural discretization of the Dirichlet problem of the elliptic Monge-Ampere equation using finite dimensional spaces of piecewise polynomial C0 or C1 functions. Standard discretizations of the type considered in this paper have been previous analyzed in the case the equation has a smooth solution and numerous numerical evidence of convergence were given in the case of non smooth solutions. Our convergence result is valid for non smooth solutions, is given in the setting of Aleksandrov solutions, and consists in discretizing the equation in a subdomain with the boundary data used as an approximation of the solution in the remaining part of the domain. Our result gives a theoretical validation for the use of a non monotone finite element method for the Monge-Amp\`ere equation

On the complexity of nonlinear mixed-integer optimization

This is a survey on the computational complexity of nonlinear mixed-integer optimization. It highlights a selection of important topics, ranging from incomputability results that arise from number theory and logic, to recently obtained fully polynomial time approximation schemes in fixed dimension, and to strongly polynomial-time algorithms for special cases.Comment: 26 pages, 5 figures; to appear in: Mixed-Integer Nonlinear Optimization, IMA Volumes, Springer-Verla

The complexity of finite-valued CSPs

We study the computational complexity of exact minimisation of rational-valued discrete functions. Let $\Gamma$ be a set of rational-valued functions on a fixed finite domain; such a set is called a finite-valued constraint language. The valued constraint satisfaction problem, $\operatorname{VCSP}(\Gamma)$, is the problem of minimising a function given as a sum of functions from $\Gamma$. We establish a dichotomy theorem with respect to exact solvability for all finite-valued constraint languages defined on domains of arbitrary finite size. We show that every constraint language $\Gamma$ either admits a binary symmetric fractional polymorphism in which case the basic linear programming relaxation solves any instance of $\operatorname{VCSP}(\Gamma)$ exactly, or $\Gamma$ satisfies a simple hardness condition that allows for a polynomial-time reduction from Max-Cut to $\operatorname{VCSP}(\Gamma)$