Computing cardinality constrained portfolio selection efficient frontiers via closest correlation matrices
From MaRDI portal
Publication:6555146
DOI10.1016/j.ejor.2023.08.026MaRDI QIDQ6555146
Ralph E. Steuer, Yue Qi, Maximilian Wimmer
Publication date: 14 June 2024
Published in: European Journal of Operational Research (Search for Journal in Brave)
portfolio optimizationcardinality constraintsefficient frontiersBuyin thresholdsclosest correlation matrices
Cites Work
- Computing the nearest correlation matrix--a problem from finance
- Algorithm for cardinality-constrained quadratic optimization
- Portfolio selection using neural networks
- Randomly generating portfolio-selection covariance matrices with specified distributional characteristics
- Extracting from the relaxed for large-scale semi-continuous variable nondominated frontiers
- Particle swarm optimization approach to portfolio optimization
- Portfolio optimization with an envelope-based multi-objective evolutionary algorithm
- Computing a nearest symmetric positive semidefinite matrix
- Heuristic algorithms for the portfolio selection problem with minimum transaction lots
- An MCDM approach to portfolio optimization.
- Heuristics for cardinality constrained portfolio optimization
- A new efficiently encoded multiobjective algorithm for the solution of the cardinality constrained portfolio optimization problem
- Computational study of a family of mixed-integer quadratic programming problems
- Large-scale MV efficient frontier computation via a procedure of parametric quadratic programming
- Heuristic algorithms for the cardinality constrained efficient frontier
- Linear vs. quadratic portfolio selection models with hard real-world constraints
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
- Genetic algorithms for portfolio selection problems with minimum transaction lots
- 60 years of portfolio optimization: practical challenges and current trends
- Optimal Cardinality Constrained Portfolio Selection
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Lagrangian relaxation procedure for cardinality-constrained portfolio optimization
- A Scalable Algorithm for Sparse Portfolio Selection
- Non-contour efficient fronts for identifying most preferred portfolios in sustainability investing
This page was built for publication: Computing cardinality constrained portfolio selection efficient frontiers via closest correlation matrices