Access the full text.
Sign up today, get DeepDyve free for 14 days.
H. Sherali, Gyunghyun Choi, Cihan Tuncbilek (2000)
A variable target value method for nondifferentiable optimizationOper. Res. Lett., 26
E. Sullivan (2003)
Risk Management for Hedge Fund PortfoliosCfa Digest, 33
H. Sherali, O. Ulular (1990)
Conjugate gradient methods using quasi-Newton updates with inexact line searchesJournal of Mathematical Analysis and Applications, 150
F. Barahona, R. Anbil (2000)
The volume algorithm: producing primal solutions with a subgradient methodMathematical Programming, 87
G. Bitran, Arnoldo Hax (1977)
On the Solution of Convex Knapsack Problems with Bounded Variables.
Churlzu Lim, H. Sherali (2006)
A Trust Region Target Value Method for Optimizing Nondifferentiable Lagrangian Duals of Linear ProgramsMathematical Methods of Operations Research, 64
J. Goffin, K. Kiwiel (1999)
Convergence of a simple subgradient level methodMathematical Programming, 85
A. Meucci (2006)
Beyond Black-Litterman in Practice: A Five-Step Recipe to Input Views on Non-Normal MarketsInstitutional & Transition Economics eJournal
P. Krokhmal, S. Uryasev, G. Zrazhevsky (2002)
Risk Management for Hedge Fund Portfolios, 5
D. Barr, Norman Sezak (1972)
A comparison of multivariate normal generatorsCommunications of the ACM, 15
K. Kiwiel (1985)
Methods of Descent for Nondifferentiable Optimization
S. Butenko, A. Golodnikov, S. Uryasev (2005)
Optimal Security Liquidation AlgorithmsComputational Optimization and Applications, 32
A. Meucci (2005)
Beyond Black-Litterman: Views on Non-Normal MarketsEconometrics eJournal
R. Rockafellar, S. Uryasev (2000)
Optimization of conditional value-at riskJournal of Risk, 3
D. Shanno (1978)
Conjugate Gradient Methods with Inexact SearchesMath. Oper. Res., 3
Churlzu Lim, H. Sherali (2006)
Convergence and Computational Analyses for Some Variable Target Value and Subgradient Deflection MethodsComputational Optimization and Applications, 34
H. Sherali, Churlzu Lim (2004)
On embedding the volume algorithm in a variable target value methodOper. Res. Lett., 32
R. Rockafellar, S. Uryasev (2001)
Conditional Value-at-Risk for General Loss DistributionsCorporate Finance and Organizations eJournal
P. Krokhmal, S. Uryasev, G. Zrazhevsky (2002)
Risk management for hedge fund portfolios: A comparative analysis of linear portfolio rebalancing strategiesJ. Altern. Invest., 5
M. Bazaraa (1993)
Nonlinear Programming: Theory and Algorithms
R. Jabr (2005)
Robust self-scheduling under price uncertainty using conditional value-at-riskIEEE Transactions on Power Systems, 20
Jordi Cabero, Á. Baíllo, S. Cerisola, M. Ventosa, A. García-Alcalde, Fernando Perán, Gregorio Relaño (2005)
A medium-term integrated risk management model for a hydrothermal generation companyIEEE Transactions on Power Systems, 20
P. Krokhmal, tanislav Uryasev, Jonas Palmquist (2001)
Portfolio optimization with conditional value-at-risk objective and constraintsJournal of Risk, 4
Boris Polyak (1969)
Minimization of unsmooth functionalsUssr Computational Mathematics and Mathematical Physics, 9
E. Scheuer, D. Stoller (1962)
On the Generation of Normal Random VectorsTechnometrics, 4
P. Krokhmal, S. Uryasev (2007)
A sample-path approach to optimal position liquidationAnnals of Operations Research, 152
Philippe Artzner, F. Delbaen, J. Eber, D. Heath (1999)
Coherent Measures of RiskMathematical Finance, 9
K. Kiwiel (1990)
Proximity control in bundle methods for convex nondifferentiable minimizationMathematical Programming, 46
R.T. Rockafellar, S. Uryasev (2002)
Conditional value-at-risk for general loss distributionsJ. Bank. Finance, 26
S. Uryas'ev (1991)
New variable-metric algorithms for nondifferentiable optimization problemsJournal of Optimization Theory and Applications, 71
F. Andersson, Helmut Mausser, D. Rosen, S. Uryasev (2001)
Credit risk optimization with Conditional Value-at-Risk criterionMathematical Programming, 89
H. Sherali, Gyunghyun Choi, Zafar Ansari (2001)
Limited Memory Space Dilation and Reduction AlgorithmsComputational Optimization and Applications, 19
(1993)
On relaxation methods for nonsmooth convex optimization
(1967)
A general method of solving extremum problems
S. Uryasev (2000)
Conditional value-at-risk: optimization algorithms and applicationsProceedings of the IEEE/IAFE/INFORMS 2000 Conference on Computational Intelligence for Financial Engineering (CIFEr) (Cat. No.00TH8520)
H. Sherali, C. Shetty (1980)
On the generation of deep disjunctive cutting planesNaval Research Logistics Quarterly, 27
M. Held, P. Wolfe, H. Crowder (1974)
Validation of subgradient optimizationMathematical Programming, 6
H. Sherali, Churlzu Lim (2007)
Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating NondifferentiabilityINFORMS J. Comput., 19
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.
Computational Optimization and Applications – Springer Journals
Published: Aug 7, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.