Finding maximum rank moment matrices by facial reduction on primal form and Douglas-Rachford iteration

DOI10.1145/3096730.3096740MaRDI QIDQ4630104zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Numerical linear algebra (65F99) Semidefinite programming (90C22) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

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

Cited in

(1)

• SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD

Describes a project that uses

Uses Software

• SeDuMi

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)