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
real algebraic geometryconvex conemoment problemssum of squares of polynomialssubnormal operatorsdecomposition of a positive polynomial
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 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
- 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
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations
- Formal Proofs for Nonlinear Optimization
- Stability analysis and control of a class of LPV systems with piecewise constant parameters
- Algebra of polynomials bounded on a semi-algebraic set \([ f\leq r ]\)
- Polynomials Positive on Unbounded Rectangles
- On solving a class of fractional semi-infinite polynomial programming problems
- A sums-of-squares extension of policy iterations
- Certificates of convexity for basic semi-algebraic sets
- Sum-of-squares for bounded rationality
- Positivstellensätze for noncommutative rational expressions
- Algebraic properties of Hermitian sums of squares
- Computation of sum of squares polynomials from data points
- Semidefinite Representation for Convex Hulls of Real Algebraic Curves
- Positive polynomials on nondegenerate basic semi-algebraic sets
- Semidefinite programming for chance constrained optimization over semialgebraic sets
- Constrained trace-optimization of polynomials in freely noncommuting variables
- Deciding robust feasibility and infeasibility using a set containment approach: an application to stationary passive gas network operations
- Moment problem for symmetric algebras of locally convex spaces
- Positive polynomials on projective limits of real algebraic varieties
- A Kadison-Dubois representation for associative rings.
- Completely positive tensor recovery with minimal nuclear value
- A version of Putinar's Positivstellensatz for cylinders
- Performance of convex underestimators in a branch-and-bound framework
- On turnpike and dissipativity properties of continuous-time optimal control problems
- A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition
- A Striktpositivstellensatz for measurable functions
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
- Monotonically positive matrices
- SDP relaxations for non-commutative polynomial optimization
- Stabilization of linear impulsive systems under dwell-time constraints: interval observer-based framework
- Infinite dimensional moment problem: open questions and applications
- Numerical approaches for collaborative data processing
- Title not available (Why is that?)
- Positivstellensatz for homogeneous semialgebraic sets
- The moment problem for continuous positive semidefinite linear functionals
- A ``joint+marginal approach in optimization
- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices
- Hermitian completely positive matrices
- Quantifying the unstable in linearized nonlinear systems
- The full infinite dimensional moment problem on semi-algebraic sets of generalized functions
- Synthesizing robust domains of attraction for state-constrained perturbed polynomial systems
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)