The Kalman filter computes the maximum a posteriori (MAP) estimate of the states for linear state space models with Gaussian noise. We interpret the Kalman filter as the solution to a convex optimization problem, and show that we can generalize the MAP state estimator to any noise with log-concave density function and any combination of linear equality and convex inequality constraints on the s...

In this paper we resolve the following problem: Given a simple polygon , what is the maximum-area polygon that is axially symmetric and is contained by ? We propose an algorithm for answering this question, analyze the algorithm’s complexity, and describe our implementation of it (for convex polygons). The algorithm is based on building and investigating a planar map, each cell of which corresp...

We review some properties of the convex roof extension, a construction used, e.g., in the definition of the entanglement of formation. Especially we consider the use of symmetries of channels and states for the construction of the convex roof. As an application we study the entanglement entropy of the diagonal map for permutation symmetric real N = 3 states ω(z) and solve the case z < 0 where z...

In this paper we solve the following optimization problem: Given a simple polygon P , what is the maximum-area polygon that is axially symmetric and is contained by P? We propose an algorithm for solving this problem, analyze its complexity, and describe our implementation of it (for the case of a convex polygon). The algorithm is based on building and investigating a planar map, each cell of w...

The Kalman filter computes the maximum a posteriori (MAP) estimate of the states for linear state space models with Gaussian noise. We interpret the Kalman filter as the solution to a convex optimization problem, and show that we can generalize the MAP state estimator to any noise with log-concave density function and any combination of linear equality and convex inequality constraints on the s...

In this paper we prove controllability results for mild solutions defined on a compact real interval for first order differential evolution inclusions in Banach spaces with non-local conditions. By using suitable fixed point theorems we study the case when the multi-valued map has convex as well as non-convex values.

Given a collection of minimal graphs,M1,M2, . . . ,Mn, with isothermal parametrizations in terms of the Gauss map and height differential, we give sufficient conditions onM1,M2, . . . ,Mn so that a convex combination of themwill be a minimal graph. We will then provide two examples, taking a convex combination of Scherk’s doubly periodic surface with the catenoid and Enneper’s surface, respecti...

A most interesting feature of certain fractional quantum Hall states is that their quasiparticles obey non-Abelian fractional statistics. So far, candidate non-Abelian wave functions have been constructed from conformal blocks in cleverly chosen conformal field theories. In this work we present a hierarchy scheme by which we can construct daughter states by condensing non-Abelian quasiparticles...

We analyse convex formulations for combined discrete-continuous MAP inference using the dual decomposition method. As a consquence we can provide a more intuitive derivation for the resulting convex relaxation than presented in the literature. Further, we show how to strengthen the relaxation by reparametrizing the potentials, hence convex relaxations for discrete-continuous inference does not ...

A matrix map F (x) is said to be (matricially) convex, if u T F (x)u is a convex function for every u. In this paper, semideenite systems of the type F (x) 0, where F (x) is ma-tricially convex, are considered. This class of problems generalizes both aane semideenite inequalities as well as ordinary convex inequality systems. After establishing characterizations and properties of matricial conv...