An efficient optimization approach for a cardinality-constrained index tracking problem
From MaRDI portal
Abstract: In the practical business environment, portfolio managers often face business-driven requirements that limit the number of constituents in their tracking portfolio. A natural index tracking model is thus to minimize a tracking error measure while enforcing an upper bound on the number of assets in the portfolio. In this paper we consider such a cardinality-constrained index tracking model. In particular, we propose an efficient nonmonotone projected gradient (NPG) method for solving this problem. At each iteration, this method usually solves several projected gradient subproblems. We show that each subproblem has a closed-form solution, which can be computed in linear time. Under some suitable assumptions, we establish that any accumulation point of the sequence generated by the NPG method is a local minimizer of the cardinality-constrained index tracking problem. We also conduct empirical tests to compare our method with the hybrid evolutionary algorithm and the hybrid half thresholding algorithm cite{L1/2} for index tracking. The computational results demonstrate that our approach generally produces sparse portfolios with smaller out-of-sample tracking error and higher consistency between in-sample and out-of-sample tracking errors. Moreover, our method outperforms the other two approaches in terms of speed.
Recommendations
- Efficient projected gradient methods for cardinality constrained optimization
- Minimizing the tracking error of cardinality constrained portfolios
- Cardinality versus \(q\)-norm constraints for index tracking
- Fast methods for the index tracking problem
- A hybrid approach for index tracking with practical constraints
Cites work
- A generalized approach to portfolio optimization: improving performance by constraining portfolio norms
- A hybrid optimization approach to index tracking
- A Nonmonotone Line Search Technique for Newton’s Method
- A nonmonotone spectral projected gradient method for large-scale topology optimization problems
- An evolutionary heuristic for the index tracking problem.
- Bicriteria Optimization Problem of Designing an Index Fund
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Lower bound theory of nonzero entries in solutions of _2-_p minimization
- Mixed-integer programming approaches for index tracking and enhanced indexation
- Nonmonotone algorithm for minimization on closed sets with applications to minimization on Stiefel manifolds
- Nonmonotone projected gradient methods based on barrier and Euclidean distances
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Optimal cardinality constrained portfolio selection
- Optimal hedging using cointegration
- Optimal Index Tracking Under Transaction Costs and Impulse Control
- Portfolio optimization with linear and fixed transaction costs
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Sparse and stable Markowitz portfolios
- Sparse Approximation via Penalty Decomposition Methods
- Sparse Reconstruction by Separable Approximation
- Two-Point Step Size Gradient Methods
Cited in
(31)- Minimizing the tracking error of cardinality constrained portfolios
- Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming
- Sparse Markowitz portfolio selection by using stochastic linear complementarity approach
- Efficient projected gradient methods for cardinality constrained optimization
- Index tracking and enhanced indexing using mixed conditional value-at-risk
- A local relaxation method for the cardinality constrained portfolio optimization problem
- Fast algorithms for sparse portfolio selection considering industries and investment styles
- A Lagrange-Newton algorithm for sparse nonlinear programming
- Mixed-integer programming approaches for index tracking and enhanced indexation
- A hybrid approach for index tracking with practical constraints
- An index tracking model with stratified sampling and optimal allocation
- On the Solution of ℓ0-Constrained Sparse Inverse Covariance Estimation Problems
- Sparse index tracking using sequential Monte Carlo
- A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization
- The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems
- High-dimensional index tracking based on the adaptive elastic net
- Cardinality versus \(q\)-norm constraints for index tracking
- A bi‐level programming framework for identifying optimal parameters in portfolio selection
- Sparse and risk diversification portfolio selection
- An enhanced GRASP approach for the index tracking problem
- Risk-allocation-based index tracking
- Penalty method for the sparse portfolio optimization problem
- A nonmonotone accelerated proximal gradient method with variable stepsize strategy for nonsmooth and nonconvex minimization problems
- Nonconvex multi-period mean-variance portfolio optimization
- A sparse enhanced indexation model with chance and cardinality constraints
- The sparse portfolio optimization with stochastic dominance and background risk and the slqpso algorithm
- Network-based index tracking using asset dependency structures
- Sparse projection onto semi-symmetric sets with applications to sparse optimization
- Exact penalization at d-stationary points of cardinality- or rank-constrained problem
- A sparse chance constrained portfolio selection model with multiple constraints
- Adaptive projected gradient thresholding methods for constrained \(l_0\) problems
This page was built for publication: An efficient optimization approach for a cardinality-constrained index tracking problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815504)
