Robust Optimization

Portfolio Optimization of Indonesian Banking Stocks Using Robust Optimization ArXiv ID: 2510.15288 “View on arXiv” Authors: Visca Tri Winarty, Sena Safarina Abstract Since the COVID-19 pandemic, the number of investors in the Indonesia Stock Exchange has steadily increased, emphasizing the importance of portfolio optimization in balancing risk and return. The classical mean-variance optimization model, while widely applied, depends on historical return and risk estimates that are uncertain and may result in suboptimal portfolios. To address this limitation, robust optimization incorporates uncertainty sets to improve portfolio reliability under market fluctuations. This study constructs such sets using moving-window and bootstrapping methods and applies them to Indonesian banking stock data with varying risk-aversion parameters. The results show that robust optimization with the moving-window method, particularly with a smaller risk-aversion parameter, provides a better risk-return trade-off compared to the bootstrapping approach. These findings highlight the potential of the moving-window method to generate more effective portfolio strategies for risk-tolerant investors. ...

(Non-Parametric) Bootstrap Robust Optimization for Portfolios and Trading Strategies ArXiv ID: 2510.12725 “View on arXiv” Authors: Daniel Cunha Oliveira, Grover Guzman, Nick Firoozye Abstract Robust optimization provides a principled framework for decision-making under uncertainty, with broad applications in finance, engineering, and operations research. In portfolio optimization, uncertainty in expected returns and covariances demands methods that mitigate estimation error, parameter instability, and model misspecification. Traditional approaches, including parametric, bootstrap-based, and Bayesian methods, enhance stability by relying on confidence intervals or probabilistic priors but often impose restrictive assumptions. This study introduces a non-parametric bootstrap framework for robust optimization in financial decision-making. By resampling empirical data, the framework constructs flexible, data-driven confidence intervals without assuming specific distributional forms, thus capturing uncertainty in statistical estimates, model parameters, and utility functions. Treating utility as a random variable enables percentile-based optimization, naturally suited for risk-sensitive and worst-case decision-making. The approach aligns with recent advances in robust optimization, reinforcement learning, and risk-aware control, offering a unified perspective on robustness and generalization. Empirically, the framework mitigates overfitting and selection bias in trading strategy optimization and improves generalization in portfolio allocation. Results across portfolio and time-series momentum experiments demonstrate that the proposed method delivers smoother, more stable out-of-sample performance, offering a practical, distribution-free alternative to traditional robust optimization methods. ...

Robust MCVaR Portfolio Optimization with Ellipsoidal Support and Reproducing Kernel Hilbert Space-based Uncertainty ArXiv ID: 2509.00447 “View on arXiv” Authors: Rupendra Yadav, Aparna Mehra Abstract This study introduces a portfolio optimization framework to minimize mixed conditional value at risk (MCVaR), incorporating a chance constraint on expected returns and limiting the number of assets via cardinality constraints. A robust MCVaR model is presented, which presumes ellipsoidal support for random returns without assuming any distribution. The model utilizes an uncertainty set grounded in a reproducing kernel Hilbert space (RKHS) to manage the chance constraint, resulting in a simplified second-order cone programming (SOCP) formulation. The performance of the robust model is tested on datasets from six distinct financial markets. The outcomes of comprehensive experiments indicate that the robust model surpasses the nominal model, market portfolio, and equal-weight portfolio with higher expected returns, lower risk metrics, enhanced reward-risk ratios, and a better value of Jensen’s alpha in many cases. Furthermore, we aim to validate the robust models in different market phases (bullish, bearish, and neutral). The robust model shows a distinct advantage in bear markets, providing better risk protection against adverse conditions. In contrast, its performance in bullish and neutral phases is somewhat similar to that of the nominal model. The robust model appears effective in volatile markets, although further research is necessary to comprehend its performance across different market conditions. ...

Robust and Sparse Portfolio Selection: Quantitative Insights and Efficient Algorithms ArXiv ID: 2412.19462 “View on arXiv” Authors: Unknown Abstract We extend the classical mean-variance (MV) framework and propose a robust and sparse portfolio selection model incorporating an ellipsoidal uncertainty set to reduce the impact of estimation errors and fixed transaction costs to penalize over-diversification. In the literature, the MV model under fixed transaction costs is referred to as the sparse or cardinality-constrained MV optimization, which is a mixed integer problem and is challenging to solve when the number of assets is large. We develop an efficient semismooth Newton-based proximal difference-of-convex algorithm to solve the proposed model and prove its convergence to at least a local minimizer with a locally linear convergence rate. We explore properties of the robust and sparse portfolio both analytically and numerically. In particular, we show that the MV optimization is indeed a robust procedure as long as an investor makes the proper choice on the risk-aversion coefficient. We contribute to the literature by proving that there is a one-to-one correspondence between the risk-aversion coefficient and the level of robustness. Moreover, we characterize how the number of traded assets changes with respect to the interaction between the level of uncertainty on model parameters and the magnitude of transaction cost. ...

Risk management in multi-objective portfolio optimization under uncertainty ArXiv ID: 2407.19936 “View on arXiv” Authors: Unknown Abstract In portfolio optimization, decision makers face difficulties from uncertainties inherent in real-world scenarios. These uncertainties significantly influence portfolio outcomes in both classical and multi-objective Markowitz models. To address these challenges, our research explores the power of robust multi-objective optimization. Since portfolio managers frequently measure their solutions against benchmarks, we enhance the multi-objective min-regret robustness concept by incorporating these benchmark comparisons. This approach bridges the gap between theoretical models and real-world investment scenarios, offering portfolio managers more reliable and adaptable strategies for navigating market uncertainties. Our framework provides a more nuanced and practical approach to portfolio optimization under real-world conditions. ...

Robust Utility Optimization via a GAN Approach ArXiv ID: 2403.15243 “View on arXiv” Authors: Unknown Abstract Robust utility optimization enables an investor to deal with market uncertainty in a structured way, with the goal of maximizing the worst-case outcome. In this work, we propose a generative adversarial network (GAN) approach to (approximately) solve robust utility optimization problems in general and realistic settings. In particular, we model both the investor and the market by neural networks (NN) and train them in a mini-max zero-sum game. This approach is applicable for any continuous utility function and in realistic market settings with trading costs, where only observable information of the market can be used. A large empirical study shows the versatile usability of our method. Whenever an optimal reference strategy is available, our method performs on par with it and in the (many) settings without known optimal strategy, our method outperforms all other reference strategies. Moreover, we can conclude from our study that the trained path-dependent strategies do not outperform Markovian ones. Lastly, we uncover that our generative approach for learning optimal, (non-) robust investments under trading costs generates universally applicable alternatives to well known asymptotic strategies of idealized settings. ...

A Framework for Treating Model Uncertainty in the Asset Liability Management Problem ArXiv ID: 2310.11987 “View on arXiv” Authors: Unknown Abstract The problem of asset liability management (ALM) is a classic problem of the financial mathematics and of great interest for the banking institutions and insurance companies. Several formulations of this problem under various model settings have been studied under the Mean-Variance (MV) principle perspective. In this paper, the ALM problem is revisited under the context of model uncertainty in the one-stage framework. In practice, uncertainty issues appear to several aspects of the problem, e.g. liability process characteristics, market conditions, inflation rates, inside information effects, etc. A framework relying on the notion of the Wasserstein barycenter is presented which is able to treat robustly this type of ambiguities by appropriate handling the various information sources (models) and appropriately reformulating the relevant decision making problem. The proposed framework can be applied to a number of different model settings leading to the selection of investment portfolios that remain robust to the various uncertainties appearing in the market. The paper is concluded with a numerical experiment for a static version of the ALM problem, employing standard modelling approaches, illustrating the capabilities of the proposed method with very satisfactory results in retrieving the true optimal strategy even in high noise cases. ...

Robust Long-Term Growth Rate of Expected Utility for Leveraged ETFs ArXiv ID: 2310.02084 “View on arXiv” Authors: Unknown Abstract This paper analyzes the robust long-term growth rate of expected utility and expected return from holding a leveraged exchange-traded fund (LETF). When the Markovian model parameters in the reference asset are uncertain, the robust long-term growth rate is derived by analyzing the worst-case parameters among an uncertainty set. We compute the growth rate and describe the optimal leverage ratio maximizing the robust long-term growth rate. To achieve this, the worst-case parameters are analyzed by the comparison principle, and the growth rate of the worst-case is computed using the martingale extraction method. The robust long-term growth rates are obtained explicitly under a number of models for the reference asset, including the geometric Brownian motion (GBM), Cox–Ingersoll–Ross (CIR), 3/2, and Heston and 3/2 stochastic volatility models. Additionally, we demonstrate the impact of stochastic interest rates, such as the Vasicek and inverse GARCH short rate models. This paper is an extended work of \citet{“Leung2017”}. ...

Doubly Robust Mean-CVaR Portfolio ArXiv ID: 2309.11693 “View on arXiv” Authors: Unknown Abstract In this study, we address the challenge of portfolio optimization, a critical aspect of managing investment risks and maximizing returns. The mean-CVaR portfolio is considered a promising method due to today’s unstable financial market crises like the COVID-19 pandemic. It incorporates expected returns into the CVaR, which considers the expected value of losses exceeding a specified probability level. However, the instability associated with the input parameter changes and estimation errors can deteriorate portfolio performance. Therefore in this study, we propose a Doubly Robust mean-CVaR Portfolio refined approach to the mean-CVaR portfolio optimization. Our method can solve the instability problem to simultaneously optimize the multiple levels of CVaRs and define uncertainty sets for the mean parameter to perform robust optimization. Theoretically, the proposed method can be formulated as a second-order cone programming problem which is the same formulation as traditional mean-variance portfolio optimization. In addition, we derive an estimation error bound of the proposed method for the finite-sample case. Finally, experiments with benchmark and real market data show that our proposed method exhibits better performance compared to existing portfolio optimization strategies. ...

Robust Hedging GANs ArXiv ID: 2307.02310 “View on arXiv” Authors: Unknown Abstract The availability of deep hedging has opened new horizons for solving hedging problems under a large variety of realistic market conditions. At the same time, any model - be it a traditional stochastic model or a market generator - is at best an approximation of market reality, prone to model-misspecification and estimation errors. This raises the question, how to furnish a modelling setup with tools that can address the risk of discrepancy between anticipated distribution and market reality, in an automated way. Automated robustification is currently attracting increased attention in numerous investment problems, but it is a delicate task due to its imminent implications on risk management. Hence, it is beyond doubt that more activity can be anticipated on this topic to converge towards a consensus on best practices. This paper presents a natural extension of the original deep hedging framework to address uncertainty in the data generating process via an adversarial approach inspired by GANs to automate robustification in our hedging objective. This is achieved through an interplay of three modular components: (i) a (deep) hedging engine, (ii) a data-generating process (that is model agnostic permitting a large variety of classical models as well as machine learning-based market generators), and (iii) a notion of distance on model space to measure deviations between our market prognosis and reality. We do not restrict the ambiguity set to a region around a reference model, but instead penalize deviations from the anticipated distribution. Our suggested choice for each component is motivated by model agnosticism, allowing a seamless transition between settings. Since all individual components are already used in practice, we believe that our framework is easily adaptable to existing functional settings. ...