A Relaxed Optimization Approach for Cardinality-Constrained Portfolio Optimization
نویسندگان
چکیده
منابع مشابه
A Robust Knapsack Based Constrained Portfolio Optimization
Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...
متن کاملEvolutionary Algorithms and the Cardinality Constrained Portfolio Optimization Problem
While the unconstrained portfolio optimization problem can be solved efficiently by standard algorithms, this is not the case for the portfolio optimization problem with additional real world constraints like cardinality constraints, buy-in thresholds, roundlots etc. In this paper we investigate two extensions to Evolutionary Algorithms (EA) applied to the portfolio optimization problem. First,...
متن کاملLexicographic goal programming approach for portfolio optimization
This paper will investigate the optimum portfolio for an investor, taking into account 5 criteria. The mean variance model of portfolio optimization that was introduced by Markowitz includes two objective functions; these two criteria, risk and return do not encompass all of the information about investment; information like annual dividends, S&P star ranking and return in later years which is ...
متن کاملSolving Cardinality Constrained Portfolio Optimization Problem by Binary Particle Swarm Optimization Algorithm
Mathematical programming methods dominate in the portfolio optimization problems, but they cannot be used if we introduce a constraint limiting the number of different assets included in the portfolio. To solve this model some of the heuristics methods (such as genetic algorithm, neural networks and particle swarm optimization algorithm) must be used. In this paper we utilize binary particle sw...
متن کاملAlgorithm for cardinality-constrained quadratic optimization
This paper describes an algorithm for cardinality-constrained quadratic optimization problems, which are convex quadratic programming problems with a limit on the number of non-zeros in the optimal solution. In particular, we consider problems of subset selection in regression and portfolio selection in asset management and propose branch-and-bound based algorithms that take advantage of the sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2018
ISSN: 1556-5068
DOI: 10.2139/ssrn.3272588