An exact penalty method for group-sparse portfolio selection

Cites work

A generalized approach to portfolio optimization: improving performance by constraining portfolio norms
A note on the convergence of ADMM for linearly constrained convex optimization problems
An application of sparse-group Lasso regularization to equity portfolio optimization and sector selection
DC formulations and algorithms for sparse optimization problems
End-to-end risk budgeting portfolio optimization with neural networks
Equally weighted cardinality constrained portfolio selection via factor models
Estimation of sparse covariance matrix via non-convex regularization
First-order methods in optimization
Fused Lasso approach in portfolio selection
Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications
Group sparse enhanced indexation model with adaptive beta value
Group sparse optimization via \(\ell_{p,q}\) regularization
Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization
Model Selection and Estimation in Regression with Grouped Variables
Modern nonconvex nondifferentiable optimization
Optimal portfolio selections via \(\ell_{1, 2}\)-norm regularization
Optimization problems involving group sparsity terms
Solving norm constrained portfolio optimization via coordinate-wise descent algorithms
Sparse and risk diversification portfolio selection
Sparse and stable Markowitz portfolios
The linearized alternating direction method of multipliers for sparse group LAD model
The Proximal Augmented Lagrangian Method for Nonsmooth Composite Optimization
Vast portfolio selection with gross-exposure constraints

This page was built for publication: An exact penalty method for group-sparse portfolio selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289117)