Dynamic portfolio optimization: time decomposition using the maximum principle with a scenario approach
From MaRDI portal
Publication:704083
DOI10.1016/j.ejor.2004.01.012zbMath1067.90129OpenAlexW2048802982MaRDI QIDQ704083
Publication date: 12 January 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.01.012
Related Items (7)
Operational Optimization for Microgrid of Buildings with Distributed Solar Power and Battery ⋮ Can long-run dynamic optimal strategies outperform fixed-mix portfolios? Evidence from multiple data sets ⋮ Combining stochastic programming and optimal control to decompose multistage stochastic optimization problems ⋮ Should you stop investing in a sinking fund when it is sinking? ⋮ A Progressive Hedging Approach for Surgery Planning Under Uncertainty ⋮ A combined stochastic programming and optimal control approach to personal finance and pensions ⋮ Tracking error: a multistage portfolio model
Cites Work
- Applying the progressive hedging algorithm to stochastic generalized networks
- Efficient dynamic programming implementations of Newton's method for unconstrained optimal control problems
- Approximate scenario solutions in the progressive hedging algorithm. A numerical study with an application to fisheries management
- Structural properties of the progressive hedging algorithm
- Dynamic stochastic programming for asset-liability management
- Computational assessment of distributed decomposition methods for stochastic linear programs
- Feasible direction algorithm for optimal control problems with state and control constraints: Implementation
- Multi-stage stochastic linear programs for portfolio optimization
- Interior point methods for optimal control of discrete time systems
- Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Stochastic Network Programming for Financial Planning Problems
- Primal-Dual Projected Gradient Algorithms for Extended Linear-Quadratic Programming
- Introduction to Stochastic Programming
- Applications of Stochastic Programming
- Mean Value Methods in Iteration
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Dynamic portfolio optimization: time decomposition using the maximum principle with a scenario approach