Beating a Benchmark: Dynamic Programming May Not Be the Right Numerical Approach
From MaRDI portal
Publication:6159077
DOI10.1137/22m1530070zbMath1516.91055MaRDI QIDQ6159077
Pieter M. Van Staden, Peter A. I. Forsyth, Yuying Li
Publication date: 1 June 2023
Published in: SIAM Journal on Financial Mathematics (Search for Journal in Brave)
Related Items (2)
Multi-Period Mean Expected-Shortfall Strategies: ‘Cut Your Losses and Ride Your Gains’ ⋮ BEATING A CONSTANT WEIGHT BENCHMARK: EASIER DONE THAN SAID
Cites Work
- A Jump-Diffusion Model for Option Pricing
- Better than pre-commitment mean-variance portfolio allocation strategies: a semi-self-financing Hamilton-Jacobi-Bellman equation approach
- Portfolio selection based on a benchmark process with dynamic value-at-risk constraints
- A theory of Markovian time-inconsistent stochastic control in discrete time
- A benchmarking approach to optimal asset allocation for insurers and pension funds
- Enhanced index tracking with CVaR-based ratio measures
- Numerical solution of the Hamilton-Jacobi-Bellman formulation for continuous time mean variance asset allocation
- Continuous-time mean-variance efficiency: the 80\% rule
- Robustness of representations in multilayer feedforward neural networks
- Bootstrap methods: another look at the jackknife
- Subsampling
- Continuous-time mean-variance portfolio selection: a stochastic LQ framework
- Portfolio management with benchmark related incentives under mean reverting processes
- Index tracking model, downside risk and non-parametric kernel estimation
- Multilayer feedforward networks are universal approximators
- Beating a moving target: optimal portfolio strategies for outperforming a stochastic benchmark
- Enhanced indexing using weighted conditional value at risk
- Portfolio optimization for an investor with a benchmark
- Benchmark-based evaluation of portfolio performance: a characterization
- Neural network with unbounded activation functions is universal approximator
- A data-driven neural network approach to optimal asset allocation for target based defined contribution pension plans
- Optimal Dynamic Portfolio Selection: Multiperiod Mean-Variance Formulation
- Optimal portfolio allocations with tracking error volatility and stochastic hedging constraints
- On efficiency of mean–variance based portfolio selection in defined contribution pension schemes
- Risk-Constrained Dynamic Active Portfolio Management
- Risk Management with Benchmarking
- Tracking a Financial Benchmark Using a Few Assets
- Risk-sensitive benchmarked asset management
- Acceleration of Stochastic Approximation by Averaging
- The Stationary Bootstrap
- Outperformance and Tracking: Dynamic Asset Allocation for Active and Passive Portfolio Management
- Stochastic portfolio theory optimization and the origin of rule-based investing
- Reaching goals by a deadline: digital options and continuous-time active portfolio management
- Lévy Processes and Stochastic Calculus
- On the Distribution of Terminal Wealth under Dynamic Mean-Variance Optimal Investment Strategies
- Index tracking through deep latent representation learning
- Optimal Tracking Portfolio with a Ratcheting Capital Benchmark
- Optimal asset allocation for outperforming a stochastic benchmark target
- Machine Learning in Finance
- Lasso-based simulation for high-dimensional multi-period portfolio optimization
- Deep Neural Networks Algorithms for Stochastic Control Problems on Finite Horizon: Convergence Analysis
- Deep hedging
- Management of Portfolio Depletion Risk through Optimal Life Cycle Asset Allocation
- Optimal Asset Allocation for Retirement Saving: Deterministic Vs. Time Consistent Adaptive Strategies
- Block bootstrap methods and the choice of stocks for the long run
- Option pricing when underlying stock returns are discontinuous
- Common risk factors in the returns on stocks and bonds
- Arbitrage Theory in Continuous Time
- Applied stochastic control of jump diffusions
- Optimal investment with minimum performance constraints
- The impact of bootstrap methods on time series analysis
- Unnamed Item
This page was built for publication: Beating a Benchmark: Dynamic Programming May Not Be the Right Numerical Approach