An alternating projection algorithm for the “approximate” GCD calculation
Sign Up to like & getrecommendations! Published in 2020 at "IFAC-PapersOnLine"
DOI: 10.1016/j.ifacol.2020.12.1630
Abstract: In the paper an approach is proposed for calculating the “best” approximate GCD of a set of coprime polynomials. The algorithm is motivated by the factorisation of the Sylvester resultant matrix of polynomial sets with… read more here.
Keywords: alternating projection; approximate gcd; projection algorithm; gcd ... See more keywords
Robust Matrix Completion via Alternating Projection
Sign Up to like & getrecommendations! Published in 2017 at "IEEE Signal Processing Letters"
DOI: 10.1109/lsp.2017.2685518
Abstract: Matrix completion aims to find the missing entries from incomplete observations using the low-rank property. Conventional convex optimization based techniques for matrix completion minimize the nuclear norm subject to a constraint on the Frobenius norm… read more here.
Keywords: completion; constraint set; matrix completion; alternating projection ... See more keywords