Pages that link to "Item:Q4501121"
From MaRDI portal
The following pages link to Polynomials that are positive on an interval (Q4501121):
Displayed 34 items.
- Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares (Q258393) (← links)
- Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions (Q373942) (← links)
- On the Lorentz degree of a product of polynomials (Q476130) (← links)
- Tunable halfband-pair wavelet filter banks and application to multifocus image fusion (Q645899) (← links)
- First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials (Q662299) (← links)
- Two-sided space-time \(L^1\) polynomial approximation of hypographs within polynomial optimal control (Q781560) (← links)
- Signomial and polynomial optimization via relative entropy and partial dualization (Q823883) (← links)
- Certificates of positivity in the Bernstein basis (Q938310) (← links)
- A semidefinite programming approach to the generalized problem of moments (Q995783) (← links)
- Complexity estimates for representations of Schmüdgen type. (Q1599208) (← links)
- Constraints on flavored 2d CFT partition functions (Q1748826) (← links)
- Generalized Bernstein operators on the classical polynomial spaces (Q1757040) (← links)
- The membership problem for finitely generated quadratic modules in the univariate case (Q1934974) (← links)
- Polynomials non-negative on strips and half-strips (Q1934977) (← links)
- Polynomials that preserve nonnegative matrices (Q2070842) (← links)
- QFT, EFT and GFT (Q2085394) (← links)
- Bounds-constrained polynomial approximation using the Bernstein basis (Q2168063) (← links)
- On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← links)
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems (Q2307704) (← links)
- Positivity and convexity in rings of fractions (Q2464739) (← links)
- Global optimization of rational functions: a semidefinite programming approach (Q2490324) (← links)
- LMIs for constrained polynomial interpolation with application in trajectory planning (Q2504686) (← links)
- Celestial insights into the S-matrix bootstrap (Q2678146) (← links)
- An effective version of Schmüdgen's Positivstellensatz for the hypercube (Q2693779) (← links)
- Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization (Q2968176) (← links)
- (Q4635008) (← links)
- On solving a class of linear semi-infinite programming by SDP method (Q4981874) (← links)
- (Q5002829) (← links)
- Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields (Q5043730) (← links)
- Moment methods in energy minimization: New bounds for Riesz minimal energy problems (Q5217870) (← links)
- A new bound for Pólya's theorem with applications to polynomials positive on polyhedra. (Q5951566) (← links)
- Polynomial Pickands functions (Q5963499) (← links)
- On the effective Putinar's Positivstellensatz and moment approximation (Q6044976) (← links)
- Tighter bounds on transient moments of stochastic chemical systems (Q6182326) (← links)