Performance Bounds and Suboptimal Policies for Multi-period Investment

Performance Bounds and Suboptimal Policies for Multi-period Investment
Author :
Publisher :
Total Pages : 72
Release :
ISBN-10 : 1601986734
ISBN-13 : 9781601986733
Rating : 4/5 (733 Downloads)

Book Synopsis Performance Bounds and Suboptimal Policies for Multi-period Investment by : Stephen P. Boyd

Download or read book Performance Bounds and Suboptimal Policies for Multi-period Investment written by Stephen P. Boyd and published by . This book was released on 2014 with total page 72 pages. Available in PDF, EPUB and Kindle. Book excerpt: We consider 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 such as 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. Our model has 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, such as when all costs are convex quadratic, or when there are no transaction costs, our focus is on the more general case, with nonquadratic cost terms and transaction costs. We show 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, we obtain an approximate dynamic programming policy that requires the solution of a convex optimization problem, often a quadratic program, to determine the trades to carry out in each step. While we have no theoretical guarantee that the performance of our suboptimal policy is always near the performance bound (which would imply that it is nearly optimal) we observe that in numerical examples the two values are typically close.


Performance Bounds and Suboptimal Policies for Multi-period Investment Related Books

Performance Bounds and Suboptimal Policies for Multi-period Investment
Language: en
Pages: 72
Authors: Stephen P. Boyd
Categories: Mathematical optimization
Type: BOOK - Published: 2014 - Publisher:

DOWNLOAD EBOOK

We consider dynamic trading of a portfolio of assets in discrete periods over a finite time horizon, with arbitrary time-varying distribution of asset returns.
Performance Bounds and Suboptimal Policies for Multi-Period Investment
Language: en
Pages: 94
Authors: Stephen Boyd
Categories: Mathematics
Type: BOOK - Published: 2013-11 - Publisher: Now Pub

DOWNLOAD EBOOK

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
Dynamic Programming and Optimal Control
Language: en
Pages: 613
Authors: Dimitri Bertsekas
Categories: Mathematics
Type: BOOK - Published: - Publisher: Athena Scientific

DOWNLOAD EBOOK

This is the leading and most up-to-date textbook on the far-ranging algorithmic methododogy of Dynamic Programming, which can be used for optimal control, Marko
Emerging Applications of Control and Systems Theory
Language: en
Pages: 400
Authors: Roberto Tempo
Categories: Technology & Engineering
Type: BOOK - Published: 2018-02-24 - Publisher: Springer

DOWNLOAD EBOOK

This book celebrates Professor Mathukumalli Vidyasagar’s outstanding achievements in systems, control, robotics, statistical learning, computational biology,
Multi-Period Trading Via Convex Optimization
Language: en
Pages: 92
Authors: Stephen Boyd
Categories: Mathematics
Type: BOOK - Published: 2017-07-28 - Publisher:

DOWNLOAD EBOOK

This monograph collects in one place the basic definitions, a careful description of the model, and discussion of how convex optimization can be used in multi-