Showing 1 - 5 of 5
In a single-objective setting, nonconvex quadratic problems can equivalently be reformulated as convex problems over the cone of completely positive matrices. In small dimensions this cone equals the cone of matrices which are entrywise nonnegative and positive semidefinite, so the convex...
Persistent link: https://www.econbiz.de/10014501675
We develop and implement a portfolio optimization method for building investment portfolios that dominate a given benchmark index in terms of third-degree stochastic dominance. Our approach relies on the properties of the semi-variance function, a refinement of an existing 'super-convex'...
Persistent link: https://www.econbiz.de/10011696295
This note develops the solutions of the static portfolio optimization problem in explicit matrix form. Three cases are contemplated and connected, with the derivation of relevant corner solutions: the unconstrained problem in the presence of risky assets only, the constrained one, and the...
Persistent link: https://www.econbiz.de/10011496187
We study mixed-integer programming (MIP) relaxation techniques for the solution of non-convex mixed-integer quadratically constrained quadratic programs (MIQCQPs). We present MIP relaxation methods for non-convex continuous variable products. In this paper, we consider MIP relaxations based on...
Persistent link: https://www.econbiz.de/10015361670
This is Part II of a study on mixed-integer programming (MIP) relaxation techniques for the solution of non-convex mixed-integer quadratically constrained quadratic programs (MIQCQPs). We set the focus on MIP relaxation methods for non-convex continuous variable products where both variables are...
Persistent link: https://www.econbiz.de/10015361673