A Strengthened SDP Relaxation for Quadratic Optimization Over the Stiefel Manifold
Samuel Burer () and
Kyungchan Park ()
Additional contact information
Samuel Burer: University of Iowa
Kyungchan Park: University of Iowa
Journal of Optimization Theory and Applications, 2024, vol. 202, issue 1, No 15, 320-339
Abstract:
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; and (ii) the use of the Kronecker matrix product to construct SDP relaxations. Using synthetic instances on five problem classes, we show that, in general, our relaxation significantly strengthens existing relaxations, although at the expense of longer solution times.
Keywords: Quadratically constrained quadratic programming; Semidefinite programming; Stiefel manifold (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10957-023-02168-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:202:y:2024:i:1:d:10.1007_s10957-023-02168-6
Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2
DOI: 10.1007/s10957-023-02168-6
Access Statistics for this article
Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull
More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().