Performance Bounds and Suboptimal Policies for Multi-period Investment PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Performance Bounds and Suboptimal Policies for Multi-period Investment PDF full book. Access full book title Performance Bounds and Suboptimal Policies for Multi-period Investment by Stephen P. Boyd. Download full books in PDF and EPUB format.
Author: Stephen P. Boyd Publisher: ISBN: 9781601986733 Category : Mathematical optimization Languages : en Pages : 72
Book Description
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.
Author: Stephen P. Boyd Publisher: ISBN: 9781601986733 Category : Mathematical optimization Languages : en Pages : 72
Book Description
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.
Author: Stephen Boyd Publisher: Now Pub ISBN: 9781601986726 Category : Mathematics Languages : en Pages : 94
Book Description
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 such as a required terminal portfolio and leverage and risk limits.
Author: Dimitri Bertsekas Publisher: Athena Scientific ISBN: 1886529434 Category : Mathematics Languages : en Pages : 613
Book Description
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, Markovian decision problems, planning and sequential decision making under uncertainty, and discrete/combinatorial optimization. The treatment focuses on basic unifying themes, and conceptual foundations. It illustrates the versatility, power, and generality of the method with many examples and applications from engineering, operations research, and other fields. It also addresses extensively the practical application of the methodology, possibly through the use of approximations, and provides an extensive treatment of the far-reaching methodology of Neuro-Dynamic Programming/Reinforcement Learning. Among its special features, the book 1) provides a unifying framework for sequential decision making, 2) treats simultaneously deterministic and stochastic control problems popular in modern control theory and Markovian decision popular in operations research, 3) develops the theory of deterministic optimal control problems including the Pontryagin Minimum Principle, 4) introduces recent suboptimal control and simulation-based approximation techniques (neuro-dynamic programming), which allow the practical application of dynamic programming to complex problems that involve the dual curse of large dimension and lack of an accurate mathematical model, 5) provides a comprehensive treatment of infinite horizon problems in the second volume, and an introductory treatment in the first volume The electronic version of the book includes 29 theoretical problems, with high-quality solutions, which enhance the range of coverage of the book.
Author: Roberto Tempo Publisher: Springer ISBN: 3319670689 Category : Technology & Engineering Languages : en Pages : 400
Book Description
This book celebrates Professor Mathukumalli Vidyasagar’s outstanding achievements in systems, control, robotics, statistical learning, computational biology, and allied areas. The contributions in the book summarize the content of invited lectures given at the workshop “Emerging Applications of Control and Systems Theory” (EACST17) held at the University of Texas at Dallas in late September 2017 in honor of Professor Vidyasagar’s seventieth birthday. These contributions are the work of twenty-eight distinguished speakers from eight countries and are related to Professor Vidyasagar’s areas of research. This Festschrift volume will remain as a permanent scientific record of this event.
Author: Stephen Boyd Publisher: ISBN: 9781680833287 Category : Mathematics Languages : en Pages : 92
Book Description
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-period trading, all in a common notation and framework.
Author: Richard O. Michaud Publisher: Oxford University Press ISBN: 0199887195 Category : Business & Economics Languages : en Pages : 207
Book Description
In spite of theoretical benefits, Markowitz mean-variance (MV) optimized portfolios often fail to meet practical investment goals of marketability, usability, and performance, prompting many investors to seek simpler alternatives. Financial experts Richard and Robert Michaud demonstrate that the limitations of MV optimization are not the result of conceptual flaws in Markowitz theory but unrealistic representation of investment information. What is missing is a realistic treatment of estimation error in the optimization and rebalancing process. The text provides a non-technical review of classical Markowitz optimization and traditional objections. The authors demonstrate that in practice the single most important limitation of MV optimization is oversensitivity to estimation error. Portfolio optimization requires a modern statistical perspective. Efficient Asset Management, Second Edition uses Monte Carlo resampling to address information uncertainty and define Resampled Efficiency (RE) technology. RE optimized portfolios represent a new definition of portfolio optimality that is more investment intuitive, robust, and provably investment effective. RE rebalancing provides the first rigorous portfolio trading, monitoring, and asset importance rules, avoiding widespread ad hoc methods in current practice. The Second Edition resolves several open issues and misunderstandings that have emerged since the original edition. The new edition includes new proofs of effectiveness, substantial revisions of statistical estimation, extensive discussion of long-short optimization, and new tools for dealing with estimation error in applications and enhancing computational efficiency. RE optimization is shown to be a Bayesian-based generalization and enhancement of Markowitz's solution. RE technology corrects many current practices that may adversely impact the investment value of trillions of dollars under current asset management. RE optimization technology may also be useful in other financial optimizations and more generally in multivariate estimation contexts of information uncertainty with Bayesian linear constraints. Michaud and Michaud's new book includes numerous additional proposals to enhance investment value including Stein and Bayesian methods for improved input estimation, the use of portfolio priors, and an economic perspective for asset-liability optimization. Applications include investment policy, asset allocation, and equity portfolio optimization. A simple global asset allocation problem illustrates portfolio optimization techniques. A final chapter includes practical advice for avoiding simple portfolio design errors. With its important implications for investment practice, Efficient Asset Management 's highly intuitive yet rigorous approach to defining optimal portfolios will appeal to investment management executives, consultants, brokers, and anyone seeking to stay abreast of current investment technology. Through practical examples and illustrations, Michaud and Michaud update the practice of optimization for modern investment management.
Author: Stephen P. Boyd Publisher: Cambridge University Press ISBN: 9780521833783 Category : Business & Economics Languages : en Pages : 744
Book Description
Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how such problems can be solved numerically with great efficiency. The book begins with the basic elements of convex sets and functions, and then describes various classes of convex optimization problems. Duality and approximation techniques are then covered, as are statistical estimation techniques. Various geometrical problems are then presented, and there is detailed discussion of unconstrained and constrained minimization problems, and interior-point methods. The focus of the book is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance and economics.
Author: Tor Lattimore Publisher: Cambridge University Press ISBN: 1108486827 Category : Business & Economics Languages : en Pages : 537
Book Description
A comprehensive and rigorous introduction for graduate students and researchers, with applications in sequential decision-making problems.
Author: Neal Parikh Publisher: Now Pub ISBN: 9781601987167 Category : Mathematics Languages : en Pages : 130
Book Description
Proximal Algorithms discusses proximal operators and proximal algorithms, and illustrates their applicability to standard and distributed convex optimization in general and many applications of recent interest in particular. Much like Newton's method is a standard tool for solving unconstrained smooth optimization problems of modest size, proximal algorithms can be viewed as an analogous tool for nonsmooth, constrained, large-scale, or distributed versions of these problems. They are very generally applicable, but are especially well-suited to problems of substantial recent interest involving large or high-dimensional datasets. Proximal methods sit at a higher level of abstraction than classical algorithms like Newton's method: the base operation is evaluating the proximal operator of a function, which itself involves solving a small convex optimization problem. These subproblems, which generalize the problem of projecting a point onto a convex set, often admit closed-form solutions or can be solved very quickly with standard or simple specialized methods. Proximal Algorithms discusses different interpretations of proximal operators and algorithms, looks at their connections to many other topics in optimization and applied mathematics, surveys some popular algorithms, and provides a large number of examples of proximal operators that commonly arise in practice.
Author: Warren B. Powell Publisher: John Wiley & Sons ISBN: 0470182954 Category : Mathematics Languages : en Pages : 487
Book Description
A complete and accessible introduction to the real-world applications of approximate dynamic programming With the growing levels of sophistication in modern-day operations, it is vital for practitioners to understand how to approach, model, and solve complex industrial problems. Approximate Dynamic Programming is a result of the author's decades of experience working in large industrial settings to develop practical and high-quality solutions to problems that involve making decisions in the presence of uncertainty. This groundbreaking book uniquely integrates four distinct disciplines—Markov design processes, mathematical programming, simulation, and statistics—to demonstrate how to successfully model and solve a wide range of real-life problems using the techniques of approximate dynamic programming (ADP). The reader is introduced to the three curses of dimensionality that impact complex problems and is also shown how the post-decision state variable allows for the use of classical algorithmic strategies from operations research to treat complex stochastic optimization problems. Designed as an introduction and assuming no prior training in dynamic programming of any form, Approximate Dynamic Programming contains dozens of algorithms that are intended to serve as a starting point in the design of practical solutions for real problems. The book provides detailed coverage of implementation challenges including: modeling complex sequential decision processes under uncertainty, identifying robust policies, designing and estimating value function approximations, choosing effective stepsize rules, and resolving convergence issues. With a focus on modeling and algorithms in conjunction with the language of mainstream operations research, artificial intelligence, and control theory, Approximate Dynamic Programming: Models complex, high-dimensional problems in a natural and practical way, which draws on years of industrial projects Introduces and emphasizes the power of estimating a value function around the post-decision state, allowing solution algorithms to be broken down into three fundamental steps: classical simulation, classical optimization, and classical statistics Presents a thorough discussion of recursive estimation, including fundamental theory and a number of issues that arise in the development of practical algorithms Offers a variety of methods for approximating dynamic programs that have appeared in previous literature, but that have never been presented in the coherent format of a book Motivated by examples from modern-day operations research, Approximate Dynamic Programming is an accessible introduction to dynamic modeling and is also a valuable guide for the development of high-quality solutions to problems that exist in operations research and engineering. The clear and precise presentation of the material makes this an appropriate text for advanced undergraduate and beginning graduate courses, while also serving as a reference for researchers and practitioners. A companion Web site is available for readers, which includes additional exercises, solutions to exercises, and data sets to reinforce the book's main concepts.
Author: Stephen P. Boyd
Author: Stephen P. Boyd
Author: Stephen Boyd
Author: Dimitri Bertsekas
Author: Roberto Tempo
Author: Stephen Boyd
Author: Richard O. Michaud
Author: Stephen P. Boyd
Author: Tor Lattimore
Author: Neal Parikh
Author: Warren B. Powell