Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm
From MaRDI portal
Publication:2247924
DOI10.1007/s10957-012-0197-0zbMath1300.91046OpenAlexW2012383525MaRDI QIDQ2247924
Publication date: 30 June 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0197-0
DCAmixed integer programmingcardinality constraintsportfolio selectioncomplementarity constraintsDC programmingthreshold constraints
Related Items
Multiperiod mean absolute deviation fuzzy portfolio selection model with risk control and cardinality constraints ⋮ DC approximation approaches for sparse optimization ⋮ DC programming and DCA for solving Brugnano-Casulli piecewise linear systems ⋮ A variable neighborhood search heuristic for the maximum ratio clique problem ⋮ The KKT optimality conditions for optimization problem with interval-valued objective function on Hadamard manifolds ⋮ DC Programming and DCA for General DC Programs ⋮ Solving the index tracking problem: a continuous optimization approach ⋮ Multi-period possibilistic mean semivariance portfolio selection with cardinality constraints and its algorithm ⋮ Norm constrained minimum variance portfolios with short selling ⋮ Solving an Infinite-Horizon Discounted Markov Decision Process by DC Programming and DCA ⋮ The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results ⋮ Portfolio optimization model with and without options under additional constraints ⋮ Time-consistent multiperiod mean semivariance portfolio selection with the real constraints ⋮ DC programming and DCA: thirty years of developments ⋮ Chance-constrained multiperiod mean absolute deviation uncertain portfolio selection ⋮ Multiperiod mean absolute deviation uncertain portfolio selection with real constraints ⋮ Multi-objective robust cross-market mixed portfolio optimization under hierarchical risk integration
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Portfolio optimization under D.C. transaction costs and minimal transaction unit constraints
- Portfolio selection using neural networks
- DC programming and DCA for globally solving the value-at-risk
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Exact penalty in d. c. programming
- Heuristics for cardinality constrained portfolio optimization
- From stochastic dominance to mean-risk models: Semideviations as risk measures
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Mixed-integer programming approaches for index tracking and enhanced indexation
- Integer programming approaches in mean-risk models
- Optimization of a long-short portfolio under nonconvex transaction cost
- Global optimization versus integer programming in portfolio optimization under nonconvex transaction costs
- A continuous approch for globally solving linearly constrained quadratic
- DC programming approach for portfolio optimization under step increasing transaction costs
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints
- Applications of Global Optimization to Portfolio Analysis
- Convex Analysis
- On consistency of stochastic dominance and mean-semideviation models
- Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints