A Strengthened SDP Relaxation for Quadratic Optimization Over the Stiefel Manifold

arXiv2208.03125MaRDI QIDQ6407076FDOQ6407076

Publication date: 5 August 2022

Abstract: We study semidefinite programming (SDP) relaxations for the NP-hard problem of globally optimizing a quadratic function over the Stiefel manifold. We introduce a strengthened relaxation based on two recent ideas in the literature: (i) a tailored SDP for objectives with a block-diagonal Hessian; (ii) and the use of the Kronecker matrix product to construct SDP relaxations. Using synthetic instances on four problem classes, we show that, in general, our relaxation significantly strengthens existing relaxations, although at the expense of longer solution times.

This page was built for publication: A Strengthened SDP Relaxation for Quadratic Optimization Over the Stiefel Manifold

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