A polynomial case of the cardinality-constrained quadratic optimization problem

DOI10.1007/s10898-012-9853-zzbMath1296.90085OpenAlexW1996696279WikidataQ57445426 ScholiaQ57445426MaRDI QIDQ2393087

Jian-Jun Gao, Li, Duan

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

zbMATH Keywords

nonconvex optimizationcell enumerationcardinality-constrained quadratic optimizationfixed parameter polynomial algorithm

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20)

Related Items

The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems ⋮ A Nonconvex Optimization Approach to IMRT Planning with Dose–Volume Constraints ⋮ On a Reformulation of Mathematical Programs with Cardinality Constraints ⋮ Recent advances in mathematical programming with semi-continuous variables and cardinality constraint ⋮ Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming ⋮ Sparse approximation over the cube ⋮ Sparse tangent portfolio selection via semi-definite relaxation ⋮ Equally weighted cardinality constrained portfolio selection via factor models ⋮ A polynomial case of convex integer quadratic programming problems with box integer constraints ⋮ Subset Selection in Sparse Matrices ⋮ Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithm for cardinality-constrained quadratic optimization
• Heuristics for cardinality constrained portfolio optimization
• Computational study of a family of mixed-integer quadratic programming problems
• Reverse search for enumeration
• Lagrangian relaxation procedure for cardinality-constrained portfolio optimization
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Algorithmic complexity: threeNP- hard problems in computational statistics
• Cardinality Constrained Linear-Quadratic Optimal Control
• OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
• Compressed sensing
• A polynomial case of unconstrained zero-one quadratic optimization