Tight SDP relaxations for cardinality-constrained problems

DOI10.1007/978-3-031-08623-6_26MaRDI QIDQ6606656

Angelika Wiegele, Shudian Zhao

Publication date: 17 September 2024

zbMATH Keywords

semidefinite programmingmixed-integer nonlinear programmingcardinality-constrained problem

Mathematics Subject Classification ID

Semidefinite programming (90C22) Mixed integer programming (90C11)

Cites Work

• Computational study of a family of mixed-integer quadratic programming problems
• A semidefinite programming heuristic for quadratic programming problems with complementarity constraints
• SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
• Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach
• The Linear-Quadratic Bilevel Programming Problem
• Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method

This page was built for publication: Tight SDP relaxations for cardinality-constrained problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606656)