Time and nodal decomposition with implicit non-anticipativity constraints in dynamic portfolio optimization
Diana Barro () and
GE, Growth, Math methods from University Library of Munich, Germany
We propose a decomposition method for the solution of a dynamic portfolio optimization problem which fits the formulation of a multistage stochastic programming problem. The method allows to obtain time and nodal decomposition of the problem in its arborescent formulation applying a discrete version of Pontryagin Maximum Principle. The solution of the decomposed problems is coordinated through a fixed- point weighted iterative scheme. The introduction of an optimization step in the choice of the weights at each iteration allows to solve the original problem in a very efficient way.
Keywords: Stochastic programming; Discrete time optimal control problem; Iterative scheme; Portfolio optimization (search for similar items in EconPapers)
JEL-codes: C61 C63 D81 G11 (search for similar items in EconPapers)
Pages: 18 pages
New Economics Papers: this item is included in nep-fin
Note: Type of Document - pdf; pages: 18
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2) Track citations by RSS feed
Downloads: (external link)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:wpa:wuwpge:0510011
Access Statistics for this paper
More papers in GE, Growth, Math methods from University Library of Munich, Germany
Bibliographic data for series maintained by EconWPA ().