Efficient Rank Minimization to Tighten Semidefinite Programming for Unconstrained Binary Quadratic Optimization

From MaRDI portal
Publication:6289817

arXiv1708.01690MaRDI QIDQ6289817

Roman Pogodin, Mikhail Krechetov, Yury Maximov

Publication date: 4 August 2017




Has companion code repository: https://github.com/romanpogodin/nonconvexity-stories









This page was built for publication: Efficient Rank Minimization to Tighten Semidefinite Programming for Unconstrained Binary Quadratic Optimization

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6289817&oldid=35866176"
Powered by MediaWiki