Search
Search Results
-
Nonconvex Optimization for Communication Networks
Nonlinear convex optimization has provided both an insightful modeling language and a powerful solution tool to the analysis and design of... -
POLYNOMIALS POSITIVE ON DOMAINS
In Section 1.4, we have presented parameterizations of univariate polynomials that are positive on an interval. -
Matrix Sum-of-Squares Relaxations for Robust Semi-Definite Programs
We consider robust semi-definite programs which depend polynomially or rationally on some uncertain parameter that is only known to be contained in a...
-
Certificates for nonnegativity of polynomials with zeros on compact semialgebraic sets
We prove a criterion for an element of a commutative ring to be contained in an archimedean subsemiring. It can be used to investigate the question...
-
When Does a Submodule of (ℝ[x 1 ⋯, x k]) n Contain a Positive Element?
We characterize for modules consisting of tuples of Laurent polynomials with real coefficients whether such a module contains a positive element....
-
Positive polynomials on compact sets
The aim of this note is to give short algebraic proofs of theorems of Handelman, Pólya and Schmüdgen concerning the algebraic structure of...