Convex optimization approaches to maximally predictable portfolio selection
From MaRDI portal
Recommendations
- Maximization of the ratio of two convex quadratic functions over a polytope
- A MAXIMAL PREDICTABILITY PORTFOLIO MODEL: ALGORITHM AND PERFORMANCE EVALUATION
- A maximal predictability portfolio using absolute deviation reformulation
- Portfolio optimization with linear and fixed transaction costs
- Large-Scale Portfolio Optimization
Cites work
- A MAXIMAL PREDICTABILITY PORTFOLIO MODEL: ALGORITHM AND PERFORMANCE EVALUATION
- A maximal predictability portfolio using absolute deviation reformulation
- A maximal predictability portfolio using dynamic factor selection strategy
- An efficient algorithm for solving convex-convex quadratic fractional programs
- Common risk factors in the returns on stocks and bonds
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Maximization of the ratio of two convex quadratic functions over a polytope
- MAXIMIZING PREDICTABILITY IN THE STOCK AND BOND MARKETS
- Minimization of the ratio of functions defined as sums of the absolute values
- On Nonlinear Fractional Programming
Cited in
(6)- A maximal predictability portfolio using absolute deviation reformulation
- A MAXIMAL PREDICTABILITY PORTFOLIO MODEL: ALGORITHM AND PERFORMANCE EVALUATION
- A MAXIMAL PREDICTABILITY PORTFOLIO SUBJECT TO A TURNOVER CONSTRAINT
- Maximization of the ratio of two convex quadratic functions over a polytope
- Portfolio construction as linearly constrained separable optimization
- Cardinality-constrained maximal predictability portfolios with an _2 regularization
This page was built for publication: Convex optimization approaches to maximally predictable portfolio selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2926485)