Efficient algorithms for computing the nearest polynomial with a real root and related problems
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Global Optimization with Polynomials and the Problem of Moments
SIAM Journal on Optimization
Factoring multivariate polynomials via partial differential equations
Mathematics of Computation
On approximate irreducibility of polynomials in several variables
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
SDPARA: semiDefinite programming algorithm paRAllel version
Parallel Computing
Approximate factorization of multivariate polynomials via differential equations
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
| Hi-index | 0.00 |
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. Effcient 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 polynomial optimization (POP)via semide finite programming (SDP). We restrict to real coe cients in the input and output polynomials.