Cardinality-constrained distributionally robust portfolio optimization
From MaRDI portal
Abstract: This paper studies a distributionally robust portfolio optimization model with a cardinality constraint for limiting the number of invested assets. We formulate this model as a mixed-integer semidefinite optimization (MISDO) problem by means of the moment-based ambiguity set of probability distributions of asset returns. To exactly solve large-scale problems, we propose a specialized cutting-plane algorithm that is based on bilevel optimization reformulation. We prove the finite convergence of the algorithm. We also apply a matrix completion technique to lower-level SDO problems to make their problem sizes much smaller. Numerical experiments demonstrate that our cutting-plane algorithm is significantly faster than the state-of-the-art MISDO solver SCIP-SDP. We also show that our portfolio optimization model can achieve good investment performance compared with the conventional robust optimization model based on the ellipsoidal uncertainty set.
Cites work
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
- A framework for solving mixed-integer semidefinite programs
- A generalized approach to portfolio optimization: improving performance by constraining portfolio norms
- A new branch and bound method for a discrete truss topology design problem
- A Scalable Algorithm for Sparse Portfolio Selection
- A unified approach to mixed-integer optimization problems with logical constraints
- A well-conditioned estimator for large-dimensional covariance matrices
- Adjusted robust mean-value-at-risk model: less conservative robust portfolios
- Bayesian estimation of the global minimum variance portfolio
- BEST SUBSET SELECTION FOR ELIMINATING MULTICOLLINEARITY
- Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization
- Calibration of distributionally robust empirical optimization models
- Cardinality-constrained portfolio optimization with short selling and risk-neutral interest rate
- Certifiably optimal sparse inverse covariance estimation
- Computational study of a family of mixed-integer quadratic programming problems
- Data-driven risk-averse stochastic optimization with Wasserstein metric
- Data-driven robust optimization
- Distributionally robust joint chance constraints with second-order moment information
- Distributionally robust optimization and its tractable approximations
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Frameworks and results in distributionally robust optimization
- Global optimization of robust truss topology via mixed integer semidefinite programming
- Heuristics for cardinality constrained portfolio optimization
- Higher order moments of the estimated tangency portfolio weights
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- scientific article; zbMATH DE number 7625166 (Why is no real title available?)
- Large-Scale Portfolio Optimization
- Lectures on Stochastic Programming
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- On the role of norm constraints in portfolio selection
- Optimal portfolio selection with singular covariance matrix
- Outer approximation with conic certificates for mixed-integer convex problems
- Robust asset allocation
- Robust Mean-Covariance Solutions for Stochastic Optimization
- Robust optimization
- Robust optimization and portfolio selection: the cost of robustness
- Robust optimization-methodology and applications
- Robust Portfolio Selection Problems
- Robust portfolio techniques for mitigating the fragility of CVaR minimization and generalization to coherent risk measures
- Robust portfolios: contributions from operations research and finance
- Robust solutions of uncertain linear programs
- Robust VaR and CVaR optimization under joint ambiguity in distributions, means, and covariances
- SCIP: solving constraint integer programs
- Shrinkage Algorithms for MMSE Covariance Estimation
- Singular inverse Wishart distribution and its application to portfolio theory
- Solving 0-1 semidefinite programs for distributionally robust allocation of surgery blocks
- The sample average approximation method for stochastic discrete optimization
- Tractable robust expected utility and risk models for portfolio optimization
- Twenty years of linear programming based portfolio optimization
- Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
Cited in
(9)- Solving cardinality constrained mean-variance portfolio problems via MILP
- Distributionally robust portfolio optimization with linearized STARR performance measure
- Robust portfolio optimization with fuzzy TODIM, genetic algorithm and multi-criteria constraints
- Distributionally robust optimization with generalized total variation ambiguity sets
- Discrete level-bundle method for mean-CVaR portfolio optimization with cardinality constraint
- Distributionally robust sparse portfolio optimization model under satisfaction criterion
- Convex and sphere packing approaches to portfolio optimization
- Cardinality-constrained maximal predictability portfolios with an _2 regularization
- Cardinality constrained portfolio selection problem: a completely positive programming approach
This page was built for publication: Cardinality-constrained distributionally robust portfolio optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6112845)
