Robust portfolio selection problems
Mathematics of Operations Research
Robust Mean-Covariance Solutions for Stochastic Optimization
Operations Research
Minimax estimation by probabilistic criterion
Automation and Remote Control
A Semidefinite Programming Approach to Optimal-Moment Bounds for Convex Classes of Distributions
Mathematics of Operations Research
Multi-period portfolio optimization with linear control policies
Automatica (Journal of IFAC)
Cutting-set methods for robust convex optimization with pessimizing oracles
Optimization Methods & Software
Constructing Risk Measures from Uncertainty Sets
Operations Research
A Perception-Based Portfolio Under Uncertainty: Minimization of Average Rates of Falling
MDAI '09 Proceedings of the 6th International Conference on Modeling Decisions for Artificial Intelligence
Robust and chance-constrained optimization under polynomial uncertainty
ACC'09 Proceedings of the 2009 conference on American Control Conference
Wardrop Equilibria with Risk-Averse Users
Transportation Science
α-Conservative approximation for probabilistically constrained convex programs
Computational Optimization and Applications
A Soft Robust Model for Optimization Under Ambiguity
Operations Research
Distributionally Robust Optimization and Its Tractable Approximations
Operations Research
Worst-case VaR and robust portfolio optimization with interval random uncertainty set
Expert Systems with Applications: An International Journal
A statistical minimax approach to optimizing linear models under a priori uncertainty conditions
Journal of Computer and Systems Sciences International
Approximation algorithms for reliable stochastic combinatorial optimization
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A robust mean absolute deviation model for portfolio optimization
Computers and Operations Research
A dynamic value-at-risk portfolio model
MDAI'11 Proceedings of the 8th international conference on Modeling decisions for artificial intelligence
Robust portfolio selection problem for an insurer with exponential utility preference
WSEAS Transactions on Mathematics
Robust optimization framework for cardinality constrained portfolio problem
Applied Soft Computing
Theory and Applications of Robust Optimization
SIAM Review
Computers and Operations Research
Robust portfolio selection involving options under a " marginal+joint " ellipsoidal uncertainty set
Journal of Computational and Applied Mathematics
Asset allocation using reliability method
Mathematical and Computer Modelling: An International Journal
Robust portfolio selection with uncertain exit time using worst-case VaR strategy
Operations Research Letters
Polymatroids and mean-risk minimization in discrete optimization
Operations Research Letters
The submodular knapsack polytope
Discrete Optimization
Robust profit opportunities in risky financial portfolios
Operations Research Letters
Robust portfolio optimization: a conic programming approach
Computational Optimization and Applications
Optimization Under Probabilistic Envelope Constraints
Operations Research
Direct data-driven portfolio optimization with guaranteed shortfall probability
Automatica (Journal of IFAC)
Worst-Case Value at Risk of Nonlinear Portfolios
Management Science
Multiple Objectives Satisficing Under Uncertainty
Operations Research
SDP reformulation for robust optimization problems based on nonconvex QP duality
Computational Optimization and Applications
Regularized robust optimization: the optimal portfolio execution case
Computational Optimization and Applications
Journal of Computational and Applied Mathematics
| Hi-index | 0.01 |
Classical formulations of the portfolio optimization problem, such as mean-variance or Value-at-Risk (VaR) approaches, can result in a portfolio extremely sensitive to errors in the data, such as mean and covariance matrix of the returns. In this paper we propose a way to alleviate this problem in a tractable manner. We assume that the distribution of returns is partially known, in the sense that onlybounds on the mean and covariance matrix are available. We define the worst-case Value-at-Risk as the largest VaR attainable, given the partial information on the returns' distribution. We consider the problem of computing and optimizing the worst-case VaR, and we show that these problems can be cast as semidefinite programs. We extend our approach to various other partial information on the distribution, including uncertainty in factor models, support constraints, and relative entropy information.