Value-at-risk optimization using the difference of convex algorithm
From MaRDI portal
Publication:1929961
DOI10.1007/s00291-010-0225-0zbMath1282.91313OpenAlexW1992422840MaRDI QIDQ1929961
Publication date: 10 January 2013
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-010-0225-0
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
Risk-budgeting multi-portfolio optimization with portfolio and marginal risk constraints ⋮ VaR as the CVaR sensitivity: applications in risk optimization ⋮ Model and efficient algorithm for the portfolio selection problem with real‐world constraints under value‐at‐risk measure ⋮ An Inner-Outer Approximation Approach to Chance Constrained Optimization ⋮ DC Algorithm for Extended Robust Support Vector Machine ⋮ On the pervasiveness of difference-convexity in optimization and statistics ⋮ Minimizing value-at-risk in single-machine scheduling ⋮ DC programming and DCA: thirty years of developments ⋮ Computing near-optimal value-at-risk portfolios using integer programming techniques ⋮ Differential equations connecting VaR and CVaR ⋮ Data-driven portfolio management with quantile constraints ⋮ Convergence analysis on a smoothing approach to joint chance constrained programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Handling CVaR objectives and constraints in two-stage stochastic models
- A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Combination between global and local methods for solving an optimization problem over the efficient set
- Managing electricity market price risk
- A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem
- A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs
- Coherent Measures of Risk
- A continuous approch for globally solving linearly constrained quadratic
- Optimal Portfolios with Bounded Capital at Risk
- Incorporating Asymmetric Distributional Information in Robust Value-at-Risk Optimization
- A difference of convex formulation of value-at-risk constrained optimization
- Portfolio optimization under the Value-at-Risk constraint
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Trust Region Methods
- On the global minimization of the value-at-risk
- Credit risk optimization with conditional Value-at-Risk criterion
This page was built for publication: Value-at-risk optimization using the difference of convex algorithm