Showing math.OCShow all
3 papers · 1 filter
math.OC2025
Finding Maximum Determinant Principal Submatrices via Hadamard Bounds and Projection Methods
Hao Hu, Stefan Sremac, Hugo J. Woerdeman +1
An important yet challenging problem in numerical linear algebra is finding a principal submatrix with maximum determinant from a given symmetric positive semidefinite matrix. This…
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
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…