1 citations · 1 across the 5 of their papers we have counts for
Showing 2024 · math.OCShow all
2 papers · 2 filters
math.OC2024
Affine Facial Reduction for Semidefinite Relaxations of Binary and Mixed-Binary Optimization Problems
Hao Hu, Boshi Yang
Semidefinite programming (SDP) relaxations can provide strong bounds for binary and mixed-binary optimization problems, but their practical use is often limited by matrix variables…
math.OC2024★ 1 cited
The Maximum Singularity Degree for Linear and Semidefinite Programming
Hao Hu
Facial reduction (FR) is an important tool in linear and semidefinite programming, providing both algorithmic and theoretical insights into these problems. The maximum length of an…