Penalty method for the sparse portfolio optimization problem
From MaRDI portal
Publication:6574067
Cites work
- scientific article; zbMATH DE number 7370529 (Why is no real title available?)
- A Fast Matrix Majorization-Projection Method for Penalized Stress Minimization With Box Constraints
- A Lagrange-Newton algorithm for sparse nonlinear programming
- A generalized approach to portfolio optimization: improving performance by constraining portfolio norms
- A well-conditioned estimator for large-dimensional covariance matrices
- Adaptive \(l_1\)-regularization for short-selling control in portfolio selection
- An efficient optimization approach for a cardinality-constrained index tracking problem
- Cardinality versus \(q\)-norm constraints for index tracking
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Computational study of a family of mixed-integer quadratic programming problems
- DC approximation approaches for sparse optimization
- DC formulations and algorithms for sparse optimization problems
- Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
- First-order methods in optimization
- Genetic algorithm versus classical methods in sparse index tracking
- Heuristic algorithms for the cardinality constrained efficient frontier
- Heuristics for cardinality constrained portfolio optimization
- Improving the performance of MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: a semidefinite program approach
- Optimal cardinality constrained portfolio selection
- Optimal portfolio selections via \(\ell_{1, 2}\)-norm regularization
- Penalty methods for a class of non-Lipschitz optimization problems
- Solving norm constrained portfolio optimization via coordinate-wise descent algorithms
- Sparse Markowitz portfolio selection by using stochastic linear complementarity approach
- Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
- Sparse and stable Markowitz portfolios
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
- Vast portfolio selection with gross-exposure constraints
This page was built for publication: Penalty method for the sparse portfolio optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574067)