Related papers: Optimal relaxation to a planar interface in the Mu…
We propose a moment relaxation for two problems, the separation and covering problem with semi-algebraic sets generated by a polynomial of degree d. We show that (a) the optimal value of the relaxation finitely converges to the optimal…
We propose a weak solution theory for the sharp interface limit of the Cahn-Hilliard reaction model, a variational PDE for lithium-ion batteries. An essential feature of this model is the use of Butler-Volmer kinetics for lithium-ion…
In this work we study convex relaxations of quadratic optimisation problems over permutation matrices. While existing semidefinite programming approaches can achieve remarkably tight relaxations, they have the strong disadvantage that they…
In this paper, we introduce a simple methodology to leverage strong convexity and smoothness in order to obtain an optimal linear convergence rate for the Peaceman--Rachford splitting (PRS) scheme applied to optimization problems involving…
We develop a technique that can be applied to provide improved upper bounds for two important questions in linear integer optimization. - Proximity bounds: Given an optimal vertex solution for the linear relaxation, how far away is the…
This paper considers a quadratically-constrained cardinality minimization problem with applications to digital filter design, subset selection for linear regression, and portfolio selection. Two relaxations are investigated: the continuous…
Correspondence problems are often modelled as quadratic optimization problems over permutations. Common scalable methods for approximating solutions of these NP-hard problems are the spectral relaxation for non-convex energies and the…
We consider Cahn-Hilliard equations with external forcing terms. Energy decreasing and mass conservation might not hold. We show that level surfaces of the solutions of such generalized Cahn-Hilliard equations tend to the solutions of a…
We obtain new integral representations, expressed as contour integrals in the complex Fourier plane, for the solution of fully nonhomogeneous interface problems for the linearized Cahn-Hilliard equation with arbitrary initial data on the…
Lagrangian Relaxation (LR) is a powerful technique for solving large-scale Mixed Integer Linear Programming (MILP), particularly those with decomposable structures, such as vehicle routing or unit commitment problems. By relaxing the…
The relaxation complexity rc(X) of the set of integer points X contained in a polyhedron is the minimal number of inequalities needed to formulate a linear optimization problem over X without using auxiliary variables. Besides its relevance…
The solution to the initial and Dirichlet boundary value problem for a semilinear, one dimensional heat equation is approximated by a numerical method that combines the Besse relaxation scheme in time (C. R. Acad. Sci. Paris S{\'e}r. I,…
We consider an initial and Dirichlet boundary value problem for a semilinear, two dimensional heat equation over a rectangular domain. The problem is discretized in time by a version of the Relaxation Scheme proposed by C. Besse (C. R.…
We study the asymptotic limit of the Cahn-Hilliard equation on an evolving surface with prescribed velocity. The method of formally matched asymptotic expansions is extended to account for the movement of the domain. We consider various…
The Navier-Stokes-Cahn-Hilliard (NSCH) system governs the diffuse-interface dynamics of two incompressible and immiscible fluids. We consider a relaxation approximation of the NSCH system that is composed by a system of first-order…
The properties of the interface in a phase-separated solution of polymers with different degrees of polymerization and Kuhn segment lengths are calculated. The starting point is the planar interface, the profile of which is calculated in…
Interlocking interfaces are commonly employed to mitigate relative sliding under shear.Indeed, Their geometry is typically selected on grounds of fabrication convenience rather than analytical optimality. There is no reason to suppose that…
An optimal transport problem on finite spaces is a linear program. Recently, a relaxation of the optimal transport problem via strictly convex functions, especially via the Kullback--Leibler divergence, sheds new light on data sciences.…
In this paper, we present a family of new mixed finite element methods for linear elasticity for both spatial dimensions $n=2,3$, which yields a conforming and strongly symmetric approximation for stress. Applying…
In this paper, we introduce methods from convex optimization to solve the multimarginal transport type problems arise in the context of density functional theory. Convex relaxations are used to provide outer approximation to the set of…