Optimization problems with cardinality constraints
From MaRDI portal
Recommendations
- Algorithm for cardinality-constrained quadratic optimization
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Heuristics for cardinality constrained portfolio optimization
- Cardinality constrained portfolio selection problem: a completely positive programming approach
- Efficient projected gradient methods for cardinality constrained optimization
Cited in
(19)- Cardinality constrained and multicriteria (multi)cut problems
- Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization
- Efficient projected gradient methods for cardinality constrained optimization
- On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach
- Optimization problems involving collections of dependent objects
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
- An evaluation of exact methods for the multiple subset maximum cardinality selection problem
- An index tracking model with stratified sampling and optimal allocation
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems
- Combination of Among and Cardinality Constraints
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
- Relaxed method for optimization problems with cardinality constraints
- Cardinality-constrained structured data-fitting problems
- Cardinality minimization, constraints, and regularization: a survey
- Two-phase sample selection strategies for design and analysis in post-genome-wide association fine-mapping studies
- Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization
- On stationarity conditions and constraint qualifications for multiobjective optimization problems with cardinality constraints
- Network portfolio optimization with dynamic lower bounds on asset weights
This page was built for publication: Optimization problems with cardinality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4929781)
