A polynomial case of the cardinality-constrained quadratic optimization problem
DOI10.1007/S10898-012-9853-ZzbMATH Open1296.90085DBLPjournals/jgo/GaoL13OpenAlexW1996696279WikidataQ57445426 ScholiaQ57445426MaRDI QIDQ2393087FDOQ2393087
Publication date: 7 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9853-z
nonconvex optimizationcell enumerationcardinality-constrained quadratic optimizationfixed parameter polynomial algorithm
Quadratic programming (90C20) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed sensing
- Computational study of a family of mixed-integer quadratic programming problems
- Reverse search for enumeration
- Lagrangian relaxation procedure for cardinality-constrained portfolio optimization
- OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
- Algorithm for cardinality-constrained quadratic optimization
- Heuristics for cardinality constrained portfolio optimization
- A polynomial case of unconstrained zero-one quadratic optimization
- Cardinality Constrained Linear-Quadratic Optimal Control
- Algorithmic complexity: threeNP- hard problems in computational statistics
Cited In (15)
- Equally weighted cardinality constrained portfolio selection via factor models
- Subset Selection in Sparse Matrices
- Cardinality minimization, constraints, and regularization: a survey
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems
- Algorithm for cardinality-constrained quadratic optimization
- A new algorithm for quadratic integer programming problems with cardinality constraint
- Sparse tangent portfolio selection via semi-definite relaxation
- A Nonconvex Optimization Approach to IMRT Planning with Dose–Volume Constraints
- Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming
- A polynomial case of convex integer quadratic programming problems with box integer constraints
- Sparse approximation over the cube
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables
- On a Reformulation of Mathematical Programs with Cardinality Constraints
This page was built for publication: A polynomial case of the cardinality-constrained quadratic optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2393087)
