Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
From MaRDI portal
Publication:742312
DOI10.1007/s10589-013-9582-3zbMath1302.90157DBLPjournals/coap/ZhengSLS14OpenAlexW2004304335WikidataQ57445418 ScholiaQ57445418MaRDI QIDQ742312
Xiaoling Sun, Jie Sun, Li, Duan, Xiao Jin Zheng
Publication date: 18 September 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11937/36727
convex programsportfolio selectioncardinality constraintDC approximationstrengthening cutssuccessive convex approximation
Related Items (15)
Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization ⋮ Constraint qualifications and optimality conditions for optimization problems with cardinality constraints ⋮ On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization ⋮ Complex portfolio selection via convex mixed‐integer quadratic programming: a survey ⋮ Structural properties of affine sparsity constraints ⋮ Relaxed method for optimization problems with cardinality constraints ⋮ Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization ⋮ DC formulations and algorithms for sparse optimization problems ⋮ Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method ⋮ Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach ⋮ Sequential optimality conditions for cardinality-constrained optimization problems with applications ⋮ An augmented Lagrangian proximal alternating method for sparse discrete optimization problems ⋮ A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration ⋮ Penalty and Augmented Lagrangian Methods for Constrained DC Programming ⋮ A penalty PALM method for sparse portfolio selection problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A majorization-minimization approach to the sparse generalized eigenvalue problem
- A note on the complexity of \(L _{p }\) minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Algorithm for cardinality-constrained quadratic optimization
- Optimization of cardinality constrained portfolios with a hybrid local search algorithm
- Heuristics for cardinality constrained portfolio optimization
- Computational study of a family of mixed-integer quadratic programming problems
- Heuristic algorithms for the cardinality constrained efficient frontier
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
- Perspective cuts for a class of convex 0-1 mixed integer programs
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Optimal Cardinality Constrained Portfolio Selection
- A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
- Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
- Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach
- Lagrangian relaxation procedure for cardinality-constrained portfolio optimization
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- The Optimal Selection of Small Portfolios
- Optimization and nonsmooth analysis
- Numerical Optimization
- Minimum-support solutions of polyhedral concave programs*
- Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints
- 10.1162/153244303322753751
- Sparse Approximation via Penalty Decomposition Methods
- OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
This page was built for publication: Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
