Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization

Authors:
Churlzu Lim;Hanif D. Sherali;Stan Uryasev
Affiliations:
Systems Engineering & Engineering Management, University of North Carolina at Charlotte, Charlotte, USA 28223;Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, USA 24061-0118;Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA 32611-6595
Venue:
Computational Optimization and Applications
Year:
2010

Citing 9
Cited 1

Proximity control in bundle methods for convex

Mathematical Programming: Series A and B
New variable-metric algorithms for nondifferentiable optimization problems

Journal of Optimization Theory and Applications
A comparison of multivariate normal generators

Communications of the ACM
Limited Memory Space Dilation and Reduction Algorithms

Computational Optimization and Applications
Optimal Security Liquidation Algorithms

Computational Optimization and Applications
Convergence and Computational Analyses for Some Variable Target Value and Subgradient Deflection Methods

Computational Optimization and Applications
Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability

INFORMS Journal on Computing
A variable target value method for nondifferentiable optimization

Operations Research Letters
On embedding the volume algorithm in a variable target value method

Operations Research Letters

Stochastic quasigradient algorithm to minimize the function of integral quantile

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

Conditional Value-at-Risk (CVaR) is a portfolio evaluation function having appealing features such as sub-additivity and convexity. Although the CVaR function is nondifferentiable, scenario-based CVaR minimization problems can be reformulated as linear programs (LPs) that afford solutions via widely-used commercial softwares. However, finding solutions through LP formulations for problems having many financial instruments and a large number of price scenarios can be time-consuming as the dimension of the problem greatly increases. In this paper, we propose a two-phase approach that is suitable for solving CVaR minimization problems having a large number of price scenarios. In the first phase, conventional differentiable optimization techniques are used while circumventing nondifferentiable points, and in the second phase, we employ a theoretically convergent, variable target value nondifferentiable optimization technique. The resultant two-phase procedure guarantees infinite convergence to optimality. As an optional third phase, we additionally perform a switchover to a simplex solver starting with a crash basis obtained from the second phase when finite convergence to an exact optimum is desired. This three phase procedure substantially reduces the effort required in comparison with the direct use of a commercial stand-alone simplex solver (CPLEX 9.0). Moreover, the two-phase method provides highly-accurate near-optimal solutions with a significantly improved performance over the interior point barrier implementation of CPLEX 9.0 as well, especially when the number of scenarios is large. We also provide some benchmarking results on using an alternative popular proximal bundle nondifferentiable optimization technique.