Selecting a Monomial Basis for Sums of Squares Programming over a Quotient Ring Frank Permenter1 and Pablo A. Parrilo2 Abstract— In this paper we describe a method for choosing a “good” monomial basis for a sums of - Degree of a polynomial - Document - PDFSEARCH.IO

First Page	Meta Content
	Selecting a Monomial Basis for Sums of Squares Programming over a Quotient Ring Frank Permenter1 and Pablo A. Parrilo2 Abstract— In this paper we describe a method for choosing a “good” monomial basis for a sums of Add to Reading List Document Date: 2012-09-25 11:21:35 Open Document File Size: 339,17 KB Share Result on Facebook City York / Pasadena / Berlin / / Company SIAM Journal / Artificial Intelligence Laboratory / / / Facility Massachusetts Institute of Technology / California Institute of Technology / / IndustryTerm squares modeling tools / post-processing sum-of-squares programs / search increases / inner products / / Organization California Institute of Technology / Massachusetts Institute of Technology / / Person Positive Polynomials / / / Position form Pm / / ProvinceOrState Hawaii / California / Massachusetts / / PublishedMedium Symposia / / Technology end Algorithm / Applying Algorithm / proposed algorithm / / SocialTag Polynomials Invariant theory Commutative algebra Monomial Gröbner basis Polynomial Positive polynomial Degree of a polynomial Homogeneous polynomial Algebra

Selecting a Monomial Basis for Sums of Squares Programming over a Quotient Ring Frank Permenter1 and Pablo A. Parrilo2 Abstract— In this paper we describe a method for choosing a “good” monomial basis for a sums ofAdd to Reading List