Sparsity Regularized and Robust Mean Variance Portfolio Selection Under Ellipsoidal Uncertainty

arXiv:2609.11749v1 Announce Type: cross Abstract: We investigate mean-variance portfolio selection with an ell_0-penalty to promote sparsity in asset allocations. Uncertainty in the mean return vector is incorporated through an ellipsoidal uncertainty set, yielding a robust sparse optimization framework. We characterize the structure of both local and global minimizers and exploit these properties in the risk minimization and return maximization formulations. Building on this structural insight, we develop a branch-and-bound algorithm tailored to the resulting robust sparse portfolio problems, together with a new pruning rule that can discard exponentially many candidate portfolios in a single step. Extensive computational experiments on real market data, together with comparisons against a mixed-integer second-order cone programming solver, demonstrate the effectiveness and competitiveness of the proposed approach.

Related

• Wasserstein Distributionally Robust Regret Optimization
• Portfolio Optimization Proxies under Label Scarcity and Regime Shifts via Bayesian and Deterministic Students under Semi-Supervised Sandwich Training
• Vector-Quantized Discrete Latent Factors Meet Financial Priors: Dynamic Cross-Sectional Stock Ranking Prediction for Portfolio Construction
• Distributionally Robust Regret Optimal Control Under Moment-Based Ambiguity Sets

Source: arXiv cs.LG | 2026-09-11