Multi-period portfolio optimization with alpha decay

The traditional Markowitz MVO approach is based on a single-period model. Single period models do not utilize any data or decisions beyond the rebalancing time horizon with the result that their policies are {\em myopic} in nature. For long-term investors, multi-period optimization offers the opportunity to make {\em wait-and-see} policy decisions by including approximate forecasts … Read more

Semidefinite-Based Branch-and-Bound for Nonconvex Quadratic Programming

This paper presents a branch-and-bound algorithm for nonconvex quadratic programming, which is based on solving semidefinite relaxations at each node of the enumeration tree. The method is motivated by a recent branch-and-cut approach for the box-constrained case that employs linear relaxations of the first-order KKT conditions. We discuss certain limitations of linear relaxations when handling … Read more

Solving Lift-and-Project Relaxations of Binary Integer Programs

We propose a method for optimizing the lift-and-project relaxations of binary integer programs introduced by Lov\’asz and Schrijver. In particular, we study both linear and semidefinite relaxations. The key idea is a restructuring of the relaxations, which isolates the complicating constraints and allows for a Lagrangian approach. We detail an enhanced subgradient method and discuss … Read more