Optimization problems over non-negative polynomials with interpolation constraints

Optimization problems over several cones of non-negative polynomials are described; we focus on linear constraints on the coefficients that represent interpolation constraints. For these problems, the complexity of solving the dual formulation is shown to be almost independent of the number of constraints, provided that an appropriate preprocessing has been performed. These results are also extended to non-negative matrix polynomials and to interpolation constraints on the derivatives.

• metadata
• relations

Document type	Document de travail (Working Paper)
Access type	Accès libre
Publication date	2003
Collection	CORE Discussion Papers - 2003/34
Affiliation	UCL - CORE - Center for Operations Research and Econometrics
Keywords	Convex optimization ; Non-negative polynomials ; Interpolation constraints
Links	http://www.core.ucl.ac.be/services/psfiles/dp03/dp2003-34.pdf http://hdl.handle.net/2078.1/4914[Handle]

See also
	[boreal:116888]	Optimization Problems over Non-negative Polynomials with Interpolation Constraints