A Continuous Optimization Approach for the Financial Portfolio Selection under Discrete Asset Choice Constraints

Reading time: 2 minute
...

📝 Original Info

  • Title: A Continuous Optimization Approach for the Financial Portfolio Selection under Discrete Asset Choice Constraints
  • ArXiv ID: 1404.3286
  • Date: 2014-04-15
  • Authors: Researchers from original ArXiv paper

📝 Abstract

In this paper we consider a generalization of the Markowitz's Mean-Variance model under linear transaction costs and cardinality constraints. The cardinality constraints are used to limit the number of assets in the optimal portfolio. The generalized model is formulated as a mixed integer quadratic programming (MIP) problem. The purpose of this paper is to investigate a continuous approach based on difference of convex functions (DC) programming for solving the MIP model. The preliminary comparative results of the proposed approach versus CPLEX are presented.

💡 Deep Analysis

Deep Dive into A Continuous Optimization Approach for the Financial Portfolio Selection under Discrete Asset Choice Constraints.

In this paper we consider a generalization of the Markowitz’s Mean-Variance model under linear transaction costs and cardinality constraints. The cardinality constraints are used to limit the number of assets in the optimal portfolio. The generalized model is formulated as a mixed integer quadratic programming (MIP) problem. The purpose of this paper is to investigate a continuous approach based on difference of convex functions (DC) programming for solving the MIP model. The preliminary comparative results of the proposed approach versus CPLEX are presented.

📄 Full Content

In this paper we consider a generalization of the Markowitz's Mean-Variance model under linear transaction costs and cardinality constraints. The cardinality constraints are used to limit the number of assets in the optimal portfolio. The generalized model is formulated as a mixed integer quadratic programming (MIP) problem. The purpose of this paper is to investigate a continuous approach based on difference of convex functions (DC) programming for solving the MIP model. The preliminary comparative results of the proposed approach versus CPLEX are presented.

Reference

This content is AI-processed based on ArXiv data.

Start searching

Enter keywords to search articles

↑↓
ESC
⌘K Shortcut