Portfolio choice and optimal hedging with general risk functions: a simplex-like algorithm
From MaRDI portal
Publication:1011192
DOI10.1016/j.ejor.2007.09.028zbMath1157.91350OpenAlexW2011949903MaRDI QIDQ1011192
Silvia Mayoral, Raquel Balbás, Alejandro Balbas
Publication date: 8 April 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10016/13054
risk measureportfolio selectioninfinite-dimensional linear programmingdeviation measuresimplex-like method
Related Items
Market consistent valuations with financial imperfection, Hedging, Pareto optimality, and good deals, Good deals and compatible modification of risk and pricing rule: a regulatory treatment, Trade-off between robust risk measurement and market principles, A relative robust approach on expected returns with bounded CVaR for portfolio selection, Minimizing measures of risk by saddle point conditions, Hahn-Banach and sandwich theorems for equivariant vector lattice-valued operators and applications, Optimal reinsurance with general risk measures, Objective comparisons of the optimal portfolios corresponding to different utility functions, Extending pricing rules with general risk functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hedging interest rate risk by optimization in Banach spaces
- A minimax risk strategy for portfolio immunization
- Duality theory for infinite-dimensional multiobjective linear programming
- The optimal portfolio problem with coherent risk measure constraints.
- Convex measures of risk and trading constraints
- From stochastic dominance to mean-risk models: Semideviations as risk measures
- Efficient hedging with coherent risk measure
- Generalized deviations in risk analysis
- Optimality conditions in portfolio analysis with general deviation measures
- Optimization of a long-short portfolio under nonconvex transaction cost
- Coherent Measures of Risk
- A Minimax Portfolio Selection Rule with Linear Programming Solution
- Necessary conditions for min-max problems and algorithms by a relaxation procedure