Performance bounds and suboptimal policies for multi-period investment

Boyd, Stephen|Mueller, Mark T.|O'Donoghue, Brendan

ISBN 10: 1601986726 / ISBN 13: 9781601986726

Published by Now Publishers Inc, 2013

About this Item

Examines dynamic trading of a portfolio of assets in discrete periods over a finite time horizon, with arbitrary time-varying distribution of asset returns. The goal is to maximize the total expected revenue from the portfolio, while respecting constraints . Seller Inventory # 4231621

Bibliographic Details

Title: Performance bounds and suboptimal policies ...

Publisher: Now Publishers Inc

Publication Date: 2013

Binding: Soft cover

Condition: New

About this title

Synopsis:

Performance Bounds and Suboptimal Policies for Multi-Period Investment examines dynamic trading of a portfolio of assets in discrete periods over a finite time horizon, with arbitrary time-varying distribution of asset returns. The goal is to maximize the total expected revenue from the portfolio, while respecting constraints on the portfolio like a required terminal portfolio and leverage and risk limits. The revenue takes into account the gross cash generated in trades, transaction costs, and costs associated with the positions, such as fees for holding short positions. The model that is presented takes the form of a stochastic control problem with linear dynamics and convex cost function and constraints. While this problem can be tractably solved in several special cases - for example, when all costs are convex quadratic, or when there are no transaction costs - the focus is on the more general case, with nonquadratic cost terms and transaction costs. Performance Bounds and Suboptimal Policies for Multi-Period Investment shows how to use linear matrix inequality techniques and semidefinite programming to produce a quadratic bound on the value function, which in turn gives a bound on the optimal performance. This performance bound can be used to judge the performance obtained by any suboptimal policy. As a by-product of the performance bound computation, an approximate dynamic programming policy is obtained that requires the solution of a convex optimization problem, often a quadratic program, to determine the trades to carry out in each step.

About the Author:

Stephen Boyd received his PhD from the University of California, Berkeley. Since 1985 he has been a member of the Electrical Engineering Department at Stanford University, where he is now Professor and Director of the Information Systems Laboratory. He has won numerous awards for teaching and research, and is a Fellow of the IEEE. He was one of the co-founders of Barcelona Design, and is the co-author of two previous books Linear Controller Design: Limits of Performance and Linear Matrix Inequalities in System and Control Theory.