Finding maximum rank moment matrices by facial reduction on primal form and Douglas-Rachford iteration
DOI10.1145/3096730.3096740zbMATH Open1433.90173OpenAlexW2615873886MaRDI QIDQ4630104FDOQ4630104
Authors: Fei Wang, Greg Reid, Henry Wolkowicz
Publication date: 29 March 2019
Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3096730.3096740
Recommendations
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Solving rank-constrained semidefinite programs in exact arithmetic
- Solving rank-constrained semidefinite programs in exact arithmetic
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
Numerical linear algebra (65F99) Semidefinite programming (90C22) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (1)
Uses Software
This page was built for publication: Finding maximum rank moment matrices by facial reduction on primal form and Douglas-Rachford iteration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630104)