A Scalable Algorithm for Sparse Portfolio Selection
From MaRDI portal
Recommendations
Cites work
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- A unified approach to mixed-integer optimization problems with logical constraints
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Algorithm for cardinality-constrained quadratic optimization
- An exact solution approach for portfolio optimization problems under stochastic and integer constraints
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Approximated perspective relaxations: a project and lift approach
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Best subset selection via a modern optimization lens
- Complex portfolio selection via convex mixed‐integer quadratic programming: a survey
- Computational study of a family of mixed-integer quadratic programming problems
- Cones of diagonally dominant matrices
- Convex programming for disjunctive convex optimization
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
- Eigenvalue techniques for convex objective, nonconvex optimization problems
- Extended formulations in mixed integer conic quadratic programming
- Generalized Benders decomposition
- Gradient methods for minimizing composite functions
- Heuristics for cardinality constrained portfolio optimization
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3246195 (Why is no real title available?)
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Improving the approximated projected perspective reformulation by dual information
- Improving the performance of MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: a semidefinite program approach
- Large-Scale Portfolio Optimization
- Lectures on convex optimization
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
- Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
- On polyhedral and second-order cone decompositions of semidefinite optimization problems
- Optimal cardinality constrained portfolio selection
- Optimization of demand response through peak shaving
- Optimization over structured subsets of positive semidefinite matrices via column generation
- Partitioning procedures for solving mixed-variables programming problems
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Perspective reformulation and applications
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Solving mixed integer nonlinear programs by outer approximation
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
- Technical note: A robust perspective on transaction costs in portfolio optimization
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(33)- A linear programming model for selection of sparse high-dimensional multiperiod portfolios
- Large scale portfolio selection with synergies
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
- Conic formulation of QPCCs applied to truly sparse QPs
- Sparse Portfolios for High-Dimensional Financial Index Tracking
- A Sparse Learning Approach to Relative-Volatility-Managed Portfolio Selection
- A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
- Inductive Representation Learning on Dynamic Stock Co-Movement Graphs for Stock Predictions
- Distributionally robust optimization with Wasserstein metric for multi-period portfolio selection under uncertainty
- Expected mean return—standard deviation efficient frontier approximation with low‐cardinality portfolios in the presence of the risk‐free asset
- Sparse convex optimization toolkit: a mixed-integer framework
- Cardinality-constrained distributionally robust portfolio optimization
- Inexact penalty decomposition methods for optimization problems with geometric constraints
- Online portfolio selection with state-dependent price estimators and transaction costs
- Distributed primal outer approximation algorithm for sparse convex programming with separable structures
- A Path-Based Approach to Constrained Sparse Optimization
- A Scalable Algorithm For Sparse Portfolio Selection
- Computing cardinality constrained portfolio selection efficient frontiers via closest correlation matrices
- Cardinality minimization, constraints, and regularization: a survey
- Nonconvex multi-period mean-variance portfolio optimization
- Exterior-point optimization for sparse and low-rank optimization
- Cardinality constrained multi-period mean-variance portfolio optimization with regime-switching parameters
- A sparsity-driven solution method for the cardinality constrained mean-variance portfolio selection problem
- Discrete level-bundle method for mean-CVaR portfolio optimization with cardinality constraint
- Integration of prediction and optimization for smart stock portfolio selection
- End-to-end, decision-based, cardinality-constrained portfolio optimization
- Fifty years of portfolio optimization
- Sparsity penalized mean-variance portfolio selection: analysis and computation
- Efficient sparse probability measures recovery via Bregman gradient
- Distributionally robust mean-CVaR portfolio optimization with cardinality constraint
- On the computation of the efficient frontier in advanced sparse portfolio optimization
- Cardinality-constrained maximal predictability portfolios with an _2 regularization
This page was built for publication: A Scalable Algorithm for Sparse Portfolio Selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087719)
