Pages that link to "Item:Q2393087"
From MaRDI portal
The following pages link to A polynomial case of the cardinality-constrained quadratic optimization problem (Q2393087):
Displaying 11 items.
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint (Q384213) (← links)
- A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
- Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming (Q1682972) (← links)
- Sparse tangent portfolio selection via semi-definite relaxation (Q1694793) (← links)
- Equally weighted cardinality constrained portfolio selection via factor models (Q2228417) (← links)
- Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables (Q2829575) (← links)
- On a Reformulation of Mathematical Programs with Cardinality Constraints (Q2942449) (← links)
- Subset Selection in Sparse Matrices (Q4961001) (← links)
- The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems (Q5077161) (← links)
- A Nonconvex Optimization Approach to IMRT Planning with Dose–Volume Constraints (Q5087711) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
