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
• Connes' embedding conjecture and sums of Hermitian squares
• LMI relaxations in robust control
• Constructive proofs of some positivstellensätze for compact semialgebraic subsets of \(\mathbb R^{d }\)
• Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
• Controller design and value function approximation for nonlinear dynamical systems
• Robust stability and performance analysis of 2D mixed continuous-discrete-time systems with uncertainty
• A dynamic inequality generation scheme for polynomial programming
• Stochastic polynomial optimization
• Minimizing the sum of many rational functions
• Three-point bounds for energy minimization
• Convex conditions for robust stabilization of uncertain switched systems with guaranteed minimum and mode-dependent dwell-time
• Sparsity in sums of squares of polynomials
• Some applications of polynomial optimization in operations research and real-time decision making
• The truncated complex $K$-moment problem
• Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
• On Hahn-Banach theorem and some of its applications
• Positivity and optimization: beyond polynomials
• Aspects of non-commutative function theory
• Semidefinite representations for finite varieties
• Relative entropy relaxations for signomial optimization
• Moment vanishing problem and positivity: some examples
• Tensor eigenvalue complementarity problems
• Discriminants and nonnegative polynomials
• A semidefinite programming approach to the generalized problem of moments
• The inverse function theorem and the Jacobian conjecture for free analysis
• Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
• On the complexity of Putinar's Positivstellensatz
• Optimality conditions and finite convergence of Lasserre's hierarchy
• A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding
• Nonnegative Morse polynomial functions and polynomial optimization
• On an extension of Pólya's Positivstellensatz
• Partitioning procedure for polynomial optimization
• Equality-constrained minimization of polynomial functions
• New upper bounds for kissing numbers from semidefinite programming
• On the complexity of computing the handicap of a sufficient matrix
• Copositive optimization -- recent developments and applications
• PRICING A CLASS OF EXOTIC OPTIONS VIA MOMENTS AND SDP RELAXATIONS
• An algorithm for the global optimization of a class of continuous minimax problems
• Proving inequalities and solving global optimization problems via simplified CAD projection
• Computing the distance between the linear matrix pencil and the completely positive cone
• The \(\mathcal A\)-truncated \(K\)-moment problem

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)