Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
- 9 July 2013
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 59 (1-2) , 379-397
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Optimal Cardinality Constrained Portfolio SelectionOperations Research, 2013
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ MinimizationSIAM Journal on Scientific Computing, 2010
- An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer ConstraintsOperations Research, 2009
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and ImagesSIAM Review, 2009
- Enhancing Sparsity by Reweighted ℓ 1 MinimizationJournal of Fourier Analysis and Applications, 2008
- Algorithm for cardinality-constrained quadratic optimizationComputational Optimization and Applications, 2007
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQPOperations Research Letters, 2007
- Perspective cuts for a class of convex 0–1 mixed integer programsMathematical Programming, 2005
- Heuristics for cardinality constrained portfolio optimisationComputers & Operations Research, 2000
- The Optimal Selection of Small PortfoliosManagement Science, 1983