Showing 1 - 10 of 15
We propose an estimate of the optimal portfolio weights under parameter uncertainty. In theory, we prove that our new estimate is close to the true value with an upper bound. Empirical evidence shows that our new estimate can consistently outperform the naive diversification method (1/N Rule),...
Persistent link: https://www.econbiz.de/10012937049
For a conic linear system of the form Ax ∈ K, K a convex cone, several condition measures have been extensively studied in the last dozen years. Among these, Renegar's condition number C(A) is arguably the most prominent for its relation to data perturbation, error bounds, problem geometry,...
Persistent link: https://www.econbiz.de/10014026200
Persistent link: https://www.econbiz.de/10003745309
We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. We show that...
Persistent link: https://www.econbiz.de/10010318689
We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. Our approach is...
Persistent link: https://www.econbiz.de/10010288330
We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. Our approach is...
Persistent link: https://www.econbiz.de/10010288411
Persistent link: https://www.econbiz.de/10012819432
Persistent link: https://www.econbiz.de/10003936749
We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. Our approach is...
Persistent link: https://www.econbiz.de/10009375645
We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. We show that...
Persistent link: https://www.econbiz.de/10009668003