Time and nodal decomposition with implicit non-anticipativity constraints in dynamic portfolio optimization
Download full text from publisher
References listed on IDEAS
- Diana Barro & Elio Canestrelli, 2009. "Tracking error: a multistage portfolio model," Annals of Operations Research, Springer, vol. 165(1), pages 47-66, January.
- John R. Birge & Liqun Qi, 1988. "Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming," Management Science, INFORMS, vol. 34(12), pages 1472-1479, December.
- A. Ruszczynski, 1994.
"On Augmented Lagrangian Decomposition Methods For Multistage Stochastic Programs,"
wp94005, International Institute for Applied Systems Analysis.
- C.H. Rosa & A. Ruszczynski, 1994. "On Augmented Lagrangian Decomposition Methods for Multistage Stochastic Programs," Working Papers wp94125, International Institute for Applied Systems Analysis.
- Barro, Diana & Canestrelli, Elio, 2005. "Dynamic portfolio optimization: Time decomposition using the Maximum Principle with a scenario approach," European Journal of Operational Research, Elsevier, vol. 163(1), pages 217-229, May.
- Vladimirou, Hercules, 1998. "Computational assessment of distributed decomposition methods for stochastic linear programs," European Journal of Operational Research, Elsevier, vol. 108(3), pages 653-670, August.
- John R. Birge, 1985. "Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs," Operations Research, INFORMS, vol. 33(5), pages 989-1007, October.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Diana Barro & Elio Canestrelli, 2011. "Combining stochastic programming and optimal control to solve multistage stochastic optimization problems," Working Papers 2011_24, Department of Economics, University of Venice "Ca' Foscari", revised 2011.
- Diana Barro & Elio Canestrelli, 2016. "Combining stochastic programming and optimal control to decompose multistage stochastic optimization problems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(3), pages 711-742, July.
More about this item
KeywordsStochastic programming; Discrete time optimal control problem; Iterative scheme; Portfolio optimization;
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
- C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
- D81 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Criteria for Decision-Making under Risk and Uncertainty
- G11 - Financial Economics - - General Financial Markets - - - Portfolio Choice; Investment Decisions
NEP fieldsThis paper has been announced in the following NEP Reports:
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpge:0510011. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (EconWPA). General contact details of provider: http://econwpa.repec.org .
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.