scientific article; zbMATH DE number 527343

DOI10.1512/IUMJ.1993.42.42045zbMATH Open0796.12002OpenAlexW4255442211MaRDI QIDQ4285035FDOQ4285035

Authors: Mihai Putinar 

Publication date: 29 September 1994

Published in: Indiana University Mathematics Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1512/iumj.1993.42.42045

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1944285
• Positive polynomials on nondegenerate basic semi-algebraic sets
• Polynomials Positive on Unbounded Rectangles
• scientific article; zbMATH DE number 952456
• Representations of positive polynomials and optimization on noncompact semialgebraic sets

zbMATH Keywords

real algebraic geometryconvex conemoment problemssum of squares of polynomialssubnormal operatorsdecomposition of a positive polynomial

Mathematics Subject Classification ID

Semialgebraic sets and related spaces (14P10) Moment problems (44A60) Sums of squares and representations by other particular quadratic forms (11E25) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15)

Cited In (only showing first 100 items - show all)

• Dimension-free entanglement detection in multipartite Werner states
• A note on nondegenerate matrix polynomials
• Exploiting sparsity in SDP relaxation of polynomial optimization problems
• Linear conic optimization for inverse optimal control
• Higher-degree tensor eigenvalue complementarity problems
• Size-degree trade-offs for sums-of-squares and positivstellensatz proofs
• Distributionally robust optimization with moment ambiguity sets
• On sum of squares certificates of non-negativity on a strip
• The tracial moment problem on quadratic varieties
• Distributionally robust polynomial chance-constraints under mixture ambiguity sets
• Convergence of Lasserre's hierarchy: the general case
• On the exactness of Lasserre relaxations for compact convex basic closed semialgebraic sets
• On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
• Polynomial LPV approach to robust \(H_\infty\) control of nonlinear sampled-data systems
• Minimizer Extraction in Polynomial Optimization Is Robust
• On the exactness of Lasserre relaxations and pure states over real closed fields
• \(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
• Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets
• Tensor maximal correlation problems
• Optimization over trace polynomials
• Alternative SDP and SOCP approximations for polynomial optimization
• Moment-sequence transforms
• TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
• Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
• Convex computation of extremal invariant measures of nonlinear dynamical systems and Markov processes
• A survey on conic relaxations of optimal power flow problem
• On solving a class of linear semi-infinite programming by SDP method
• A toric positivstellensatz with applications to delay systems
• Multi-objective convex polynomial optimization and semidefinite programming relaxations
• Stability andL₁× ℓ₁-to-L₁× ℓ₁performance analysis of uncertain impulsive linear positive systems with applications to the interval observation of impulsive and switched systems with constant delays
• The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
• On exact Reznick, Hilbert-Artin and Putinar's representations
• The truncated Hamburger moment problems with gaps in the index set
• A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
• The relation between polynomial calculus, Sherali-Adams, and sum-of-squares proofs
• Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization
• Analysis of optimization algorithms via sum-of-squares
• The moment-SOS hierarchy and the Christoffel-Darboux kernel
• Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
• Polynomials non-negative on strips and half-strips
• Approximate super-resolution of positive measures in all dimensions
• An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem
• Computing the Hausdorff boundary measure of semialgebraic sets
• Polynomials of almost normal arguments in \(C^*\)-algebras
• Hybrid \(L_\infty \times \ell_\infty \)-performance analysis and control of linear time-varying impulsive and switched positive systems
• LP relaxations for a class of linear semi-infinite programming problems
• Observer synthesis under time-varying sampling for Lipschitz nonlinear systems
• Positive polynomials on Riesz spaces
• Polynomial optimization on some unbounded closed semi-algebraic sets
• A sublevel moment-SOS hierarchy for polynomial optimization
• Sparse noncommutative polynomial optimization
• Validating numerical semidefinite programming solvers for polynomial invariants
• Exploiting term sparsity in noncommutative polynomial optimization
• Decomposed structured subsets for semidefinite and sum-of-squares optimization
• Finding extremal periodic orbits with polynomial optimization, with application to a nine-mode model of shear flow
• Noncommutative Christoffel-Darboux kernels
• Semidefinite relaxations for semi-infinite polynomial programming
• On the complexity of Putinar-Vasilescu's Positivstellensatz
• A semidefinite method for tensor complementarity problems
• Generating exact nonlinear ranking functions by symbolic-numeric hybrid method
• Noncommutative polynomials nonnegative on a variety intersect a convex set
• Sums of squares based approximation algorithms for MAX-SAT
• Approximating amoebas and coamoebas by sums of squares
• The saddle point problem of polynomials
• POS3POLY -- a MATLAB preprocessor for optimization with positive polynomials
• Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications
• Closures of quadratic modules
• Rank of Handelman hierarchy for Max-Cut
• The \(K\)-moment problem with densities
• The truncated K-moment problem for closure of open sets
• On global optimizations with polynomials
• Discrete-time multi-scale systems
• How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
• Minimal energy configurations of bilayer plates as a polynomial optimization problem
• Positive polynomials and sequential closures of quadratic modules
• A semidefinite relaxation algorithm for checking completely positive separable matrices
• Convex underestimators of polynomials
• Lasserre hierarchy for large scale polynomial optimization in real and complex variables
• Archimedean operator-theoretic Positivstellensätze
• The singular bivariate quartic tracial moment problem
• Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
• Positive hybrid real-trigonometric polynomials and applications to adjustable filter design and absolute stability analysis
• Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
• Semidefinite Representation of Convex Sets and Convex Hulls
• Positivstellensätze for real function algebras
• Polynomial representations via spectral decompositions
• Robust portfolio optimization: a conic programming approach
• Coarse-convex-compactification approach to numerical solution of nonconvex variational problems
• Properties of the cone of non-negative polynomials and duality
• Scale transform of discrete stationary signals
• Representations of non-negative polynomials having finitely many zeros
• A moment approach for entropy solutions to nonlinear hyperbolic PDEs
• On robust stability of uncertain systems with multiple time-delays
• Certifying convergence of Lasserre's hierarchy via flat truncation
• An analogue of the Riesz-Haviland theorem for the truncated moment problem
• Non-existence of degree bounds for weighted sums of squares representations
• Stochastic 0-1 linear programming under limited distributional information
• Title not available (Why is that?)
• First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials
• A strict Positivstellensatz for enveloping algebras

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285035)