  


Lower bounds for approximate factorizations via semidefinite programming
Erich Kaltofen(kaltofenmath.ncsu.edu) Abstract: The problem of approximately factoring a real or complex multivariate polynomial $f$ seeks minimal perturbations $\Delta f$ to the coefficients of the input polynomial $f$ so that the deformed polynomial $f + \Delta f$ has the desired factorization properties. Efficient algorithms exist that compute the nearest real or complex polynomials that has nontrivial factors. (see [3] and [6] and the literature cited there). Here we consider the solution of the arising optimization problems using polynomial optimization (POP) via semidefinite programming. We restrict to real coefficients in the input and output polynomials. Keywords: Approximate factorization of polynomials, polynomial optimization, semidefinite programming Category 1: Linear, Cone and Semidefinite Programming (Semidefinite Programming ) Citation: Proceedings of SNC 07, London, Ontario, Canada, July 2527, 2007, pp. 203204 Download: [PDF] Entry Submitted: 06/06/2008 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  