Article Contents
Article Contents

# Cardinality constrained portfolio selection problem: A completely positive programming approach

• In this paper, we propose a completely positive programming reformulation of the cardinality constrained portfolio selection problem. By constructing a sequence of computable cones of nonnegative quadratic forms over a union of second-order cones, an $\epsilon$-optimal solution of the original problem can be found in finite iterations using semidefinite programming techniques. In order to obtain a good lower bound efficiently, an adaptive scheme is adopted in our approximation algorithm. The numerical results show that the proposed algorithm can find better approximate and feasible solutions than other known methods in the literature.
Mathematics Subject Classification: Primary: 90C26, 90C59, 90C22; Secondary: 30E10.

 Citation: