  


A sum of squares approximation of nonnegative polynomials
Jean B. Lasserre (lasserrelaas.fr) Abstract: We show that every real nonnegative polynomial $f$ can be approximated as closely as desired (in the $l_1$norm of its coefficient vector) by a sequence of polynomials $\{f_\epsilon\}$ that are sums of squares. The novelty is that each $f_\epsilon$ has a simple and explicit form in terms of $f$ and $\epsilon$. Keywords: Real algebraic geometry; nonnegative polynomials; Category 1: Global Optimization (Theory ) Category 2: Nonlinear Optimization Citation: SIAM J. Optimization 16 (2006), 751765. Download: Entry Submitted: 09/23/2005 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  