AMS classifications: 90C15; 90C20; 90C90; 49M29;

In this paper we argue that in realistically calibrated two period general equilibrium models with incomplete markets CAPM-pricing provides a good benchmark for equilibrium prices even when agents are not mean-variance optimizers and returns are not normally distributed. We numerically...

We address the multi-period portfolio optimization problem with the constant rebalancing strategy. This problem is formulated as a polynomial optimization problem (POP) by using a mean-variance criterion. In order to solve the POPs of high degree, we develop a cutting-plane algorithm based on...

We introduce an accurate, easily implementable, and fast algorithm to compute optimal decisions in discrete-time long-horizon welfaremaximizing problems. The algorithm is useful when interest is only in the decisions up to period T, where T is small. It relies on a flexible parametrization of...

Finding the lexicographic maximum of a polytope in Rn can be achieved by solving a suitable LP-problem.

In this paper we consider the linear quadratic differential game for descriptor systems that have index one. We derive both necessary and sufficient conditions for existence of an open-loop Nash equilibrium.

This paper adresses the robust counterparts of optimization problems containing sums of maxima of linear functions and proposes several reformulations. These problems include many practical problems, e.g. problems with sums of absolute values, and arise when taking the robust counterpart of a...

We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: [R.E....