@inproceedings{3095bacb729b43e3ad54dfc4e7423639,
title = "Lower bounds for approximate factorizations via semidefinite programming (extended abstract)",
abstract = "The problem of approximately factoring a real or complex multivariate polynomial f seeks minimal perturbations Δf to the coefficients of the input polynomial f so that the deformed polynomial f + Δf has the desired factorization properties. Efficient algorithms exist that compute the nearest real or complex polynomial that has non-trivial factors (see [3, 6] and the literature cited there). Here we consider the solution of the arising optimization problems using polynomial optimization (POP) via semidefinite programming (SDP).We restrict to real coefficients in the input and output polynomials.",
keywords = "Approximate factorization, Hybrid method, SDP",
author = "Erich Kaltofen and Bin Li and Kartik Sivaramakrishnan and Zhengfeng Yang and Lihong Zhi",
year = "2007",
doi = "10.1145/1277500.1277532",
language = "英语",
isbn = "1595937447",
series = "SNC'07 - Proceedings of the 2007 International Workshop on Symbolic-Numeric Computation",
pages = "203--204",
booktitle = "SNC'07 - Proceedings of the 2007 International Workshop on Symbolic-Numeric Computation",
note = "SNC'07 - 2007 International Workshop on Symbolic-Numeric Computation ; Conference date: 25-07-2007 Through 27-07-2007",
}