Optimal trading under non-negativity constraints using approximate dynamic programming
In this paper, we develop an extended dynamic programming (DP) approach to solve the problem of minimising execution cost in block trading of securities. To make the problem more practical, we add non-negativity constraints to the model and propose a novel approach to solve the resulting DP problem...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2018-01-05.
|
| Subjects: | |
| Online Access: | Get fulltext Get fulltext |