Polynomials that are positive on an interval
From MaRDI portal
Publication:4501121
DOI10.1090/S0002-9947-00-02595-2zbMath0957.26004MaRDI QIDQ4501121
Victoria Powers, Bruce Reznick
Publication date: 3 September 2000
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Semialgebraic sets and related spaces (14P10) Real polynomials: analytic properties, etc. (26C05)
Related Items
Signomial and polynomial optimization via relative entropy and partial dualization, Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields, Bounds-constrained polynomial approximation using the Bernstein basis, Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions, On the effective Putinar's Positivstellensatz and moment approximation, Celestial insights into the S-matrix bootstrap, The membership problem for finitely generated quadratic modules in the univariate case, Polynomials non-negative on strips and half-strips, Unnamed Item, Tighter bounds on transient moments of stochastic chemical systems, Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization, An effective version of Schmüdgen's Positivstellensatz for the hypercube, Tunable halfband-pair wavelet filter banks and application to multifocus image fusion, On the Lorentz degree of a product of polynomials, First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials, On solving a class of fractional semi-infinite polynomial programming problems, Certificates of positivity in the Bernstein basis, Positivity and convexity in rings of fractions, Constraints on flavored 2d CFT partition functions, Generalized Bernstein operators on the classical polynomial spaces, Global optimization of rational functions: a semidefinite programming approach, A new bound for Pólya's theorem with applications to polynomials positive on polyhedra., LMIs for constrained polynomial interpolation with application in trajectory planning, A semidefinite programming approach to the generalized problem of moments, Polynomial Pickands functions, Moment methods in energy minimization: New bounds for Riesz minimal energy problems, On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems, On solving a class of linear semi-infinite programming by SDP method, Polynomials that preserve nonnegative matrices, Two-sided space-time \(L^1\) polynomial approximation of hypographs within polynomial optimal control, QFT, EFT and GFT, Unnamed Item, Complexity estimates for representations of Schmüdgen type., Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
Cites Work
- On polynomials with positive coefficients
- Representing polynomials by positive linear functions on compact convex polyhedra
- The \(K\)-moment problem for compact semi-algebraic sets
- Estimates for the Lorentz degree of polynomials
- An effective version of Pólya's theorem on positive definite forms
- Complexity estimates for the Schmüdgen Positivstellensatz
- Sums of squares of regular functions on real algebraic varieties
- Geometry of moment spaces
- A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
