Representing polynomials by positive linear functions on compact convex polyhedra
From MaRDI portal
Publication:1112337
DOI10.2140/pjm.1988.132.35zbMath0659.52002OpenAlexW2037009101MaRDI QIDQ1112337
Publication date: 1988
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1988.132.35
Polynomials in real and complex fields: factorization (12D05) Convexity of real functions of several variables, generalizations (26B25) Ordered rings, algebras, modules (06F25) Ordered topological linear spaces, vector lattices (46A40) Polytopes and polyhedra (52Bxx)
Related Items (47)
Space-time boundaries for random walks obtained from diffuse measures ⋮ LP relaxations for a class of linear semi-infinite programming problems ⋮ Algebraic Perspectives on Signomial Optimization ⋮ Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets ⋮ Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity ⋮ Certificates for nonnegativity of polynomials with zeros on compact semialgebraic sets ⋮ Some Recent Developments in Spectrahedral Computation ⋮ Certifying the global optimality of quartic minimization over the sphere ⋮ Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications ⋮ Eventual positivity for analytic functions ⋮ Measures on Cantor sets: The good, the ugly, the bad ⋮ Constructive proofs of some positivstellensätze for compact semialgebraic subsets of \(\mathbb R^{d }\) ⋮ A moment approach for entropy solutions to nonlinear hyperbolic PDEs ⋮ Dwell-time stability and stabilization conditions for linear positive impulsive and switched systems ⋮ Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra ⋮ On polynomial images of a closed ball ⋮ Universal continuous calculus for Su*‐algebras ⋮ Rank of Handelman hierarchy for Max-Cut ⋮ Representing simple \(d\)-dimensional polytopes by \(d\) polynomials ⋮ On the Bennett-Hoeffding inequality ⋮ Sum-of-Squares Optimization without Semidefinite Programming ⋮ Handelman's hierarchy for the maximum stable set problem ⋮ Exploiting equalities in polynomial programming ⋮ Robust stability and instability of biochemical networks with parametric uncertainty ⋮ On the Complexity of Reachability in Parametric Markov Decision Processes ⋮ Stability andL1× ℓ1-to-L1× ℓ1performance analysis of uncertain impulsive linear positive systems with applications to the interval observation of impulsive and switched systems with constant delays ⋮ Refinement to certify abstract interpretations: illustrated on linearization for polyhedra ⋮ Effective Pólya semi-positivity for non-negative polynomials on the simplex ⋮ Optimal bounds on the positivity of a matrix from a few moments ⋮ Handelman's Positivstellensatz for polynomial matrices positive definite on polyhedra ⋮ Representation of real commutative rings ⋮ A new bound for Pólya's theorem with applications to polynomials positive on polyhedra. ⋮ Vector barrier certificates and comparison systems ⋮ Validating numerical semidefinite programming solvers for polynomial invariants ⋮ An algorithmic approach to Schmüdgen's Positivstellensatz ⋮ \(L_1 \times \ell_1\)-to-\(L_1 \times \ell_1\) analysis of linear positive impulsive systems with application to the \(L_1 \times \ell_1\)-to-\(L_1 \times \ell_1\) interval observation of linear impulsive and switched systems ⋮ Positivstellensätze for polynomial matrices ⋮ Hybrid \(L_\infty \times \ell_\infty \)-performance analysis and control of linear time-varying impulsive and switched positive systems ⋮ A Survey of Satisfiability Modulo Theory ⋮ A quantitative Pólya's theorem with zeros ⋮ Complements of unbounded convex polyhedra as polynomial images of \({{\mathbb{R}}}^n\) ⋮ Co-design of aperiodic sampled-data min-jumping rules for linear impulsive, switched impulsive and sampled-data systems ⋮ Polynomials that are positive on an interval ⋮ Robust stability and stabilization of uncertain linear positive systems via integral linear constraints:L1-gain andL∞-gain characterization ⋮ IN PRAISE OF ORDER UNITS ⋮ Error bounds for polynomial optimization over the hypercube using Putinar type representations ⋮ Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
This page was built for publication: Representing polynomials by positive linear functions on compact convex polyhedra
