Computing real solutions of polynomial systems via low-rank moment matrix completion

DOI10.1145/2442829.2442866zbMath1323.68615OpenAlexW2065235897MaRDI QIDQ5244542

Lihong Zhi, Yue Ma

Publication date: 27 March 2015

Published in: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2442829.2442866

zbMATH Keywords

semi-algebraic setalternating direction methodnuclear norm minimizationfixed point continuation methodlow-rank moment matrix completion

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Semialgebraic sets and related spaces (14P10) Solving polynomial systems; resultants (13P15)

Related Items (3)

VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities ⋮ Verified error bounds for singular solutions of nonlinear systems ⋮ Computing real witness points of positive dimensional polynomial systems

Uses Software

• PHCpack
• SeDuMi
• SDPT3
• PROPACK

This page was built for publication: Computing real solutions of polynomial systems via low-rank moment matrix completion