scientific article; zbMATH DE number 527343

From MaRDI portal
Publication:4285035

DOI10.1512/iumj.1993.42.42045zbMath0796.12002OpenAlexW4255442211MaRDI QIDQ4285035

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: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Convergence of Lasserre's hierarchy: the general case, Continuous-variable nonlocality and contextuality, Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints, Positive polynomials on fibre products, On Hahn-Banach theorem and some of its applications, Representations of non-negative polynomials having finitely many zeros, Polynomial level-set method for attractor estimation, Moment-sequence transforms, Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials, Bounding the separable rank via polynomial optimization, Sparse noncommutative polynomial optimization, On the complexity of Putinar-Vasilescu's Positivstellensatz, Positivity certificates and polynomial optimization on non-compact semialgebraic sets, Distinguished representations of non-negative polynomials, Linearisation techniques and the dual algorithm for a class of mixed singular/continuous control problems in reinsurance. I: Theoretical aspects, Certificates for nonnegativity of polynomials with zeros on compact semialgebraic sets, SIR epidemics with state-dependent costs and ICU constraints: a Hamilton-Jacobi verification argument and dual LP algorithms, Convex sets with semidefinite representation, A few more extensions of Putinar's Positivstellensatz to non-compact sets, Certifying the global optimality of quartic minimization over the sphere, On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices, Stabilization of rank-deficient continuous-time switched affine systems, Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications, The saddle point problem of polynomials, A bounded degree SOS hierarchy for polynomial optimization, Graph recovery from incomplete moment information, A sums-of-squares extension of policy iterations, Time minimal saturation of a pair of spins and application in magnetic resonance imaging, A moment approach for entropy solutions to nonlinear hyperbolic PDEs, Dwell-time stability and stabilization conditions for linear positive impulsive and switched systems, On turnpike and dissipativity properties of continuous-time optimal control problems, How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization, A semidefinite approach for truncated \(K\)-moment problems, A new approximation hierarchy for polynomial conic optimization, The moment problem for continuous positive semidefinite linear functionals, Robust and optimal registration of image sets and structured scenes via sum-of-squares polynomials, A quantitative version of Catlin-D'Angelo-Quillen theorem, An exact Jacobian SDP relaxation for polynomial optimization, Hermitian completely positive matrices, Completely positive tensors in the complex field, Polynomials of almost normal arguments in \(C^*\)-algebras, A toric positivstellensatz with applications to delay systems, The matricial relaxation of a linear matrix inequality, Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization, Certifying convergence of Lasserre's hierarchy via flat truncation, On the complexity of testing attainment of the optimal value in nonlinear optimization, Convex underestimators of polynomials, Positive hybrid real-trigonometric polynomials and applications to adjustable filter design and absolute stability analysis, A version of Putinar's Positivstellensatz for cylinders, Distributionally robust polynomial chance-constraints under mixture ambiguity sets, Semidefinite relaxations for semi-infinite polynomial programming, On solving a class of fractional semi-infinite polynomial programming problems, Exploiting term sparsity in noncommutative polynomial optimization, Idempotents and moment problem for discrete measure, Connes' embedding conjecture and sums of Hermitian squares, A note on nondegenerate matrix polynomials, On sum of squares certificates of non-negativity on a strip, The tracial moment problem on quadratic varieties, The full infinite dimensional moment problem on semi-algebraic sets of generalized functions, Global minimization of rational functions and the nearest GCDs, On the exactness of Lasserre relaxations and pure states over real closed fields, Solving the equality-constrained minimization problem of polynomial functions, Global optimization of rational functions: a semidefinite programming approach, Minimizing polynomials via sum of squares over the gradient ideal, Matrix sum-of-squares relaxations for robust semi-definite programs, Robust global optimization with polynomials, Convex computation of extremal invariant measures of nonlinear dynamical systems and Markov processes, A hierarchy of semidefinite relaxations for completely positive tensor optimization problems, Polynomial optimization on some unbounded closed semi-algebraic sets, A survey on conic relaxations of optimal power flow problem, 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, Alternative SDP and SOCP approximations for polynomial optimization, Multi-objective convex polynomial optimization and semidefinite programming relaxations, 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, An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem, \(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, On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems, Higher-degree tensor eigenvalue complementarity problems, Saddle points of rational functions, Hybrid \(L_\infty \times \ell_\infty \)-performance analysis and control of linear time-varying impulsive and switched positive systems, A semidefinite relaxation algorithm for checking completely positive separable matrices, Optimization over trace polynomials, A sublevel moment-SOS hierarchy for polynomial optimization, Decomposed structured subsets for semidefinite and sum-of-squares optimization, Co-design of aperiodic sampled-data min-jumping rules for linear impulsive, switched impulsive and sampled-data systems, Lower bounds on matrix factorization ranks via noncommutative polynomial optimization, Tight relaxations for polynomial optimization and Lagrange multiplier expressions, Dimension-free entanglement detection in multipartite Werner states, Minimizing trigonometric matrix polynomials over semi-algebraic sets, On an extension of Pólya's Positivstellensatz, Convex conditions for robust stabilization of uncertain switched systems with guaranteed minimum and mode-dependent dwell-time, Certification of real inequalities: templates and sums of squares, Tractable approximations of sets defined with quantifiers, Distributionally robust optimization with moment ambiguity sets, Error bounds for polynomial optimization over the hypercube using Putinar type representations, Minimizing the sum of many rational functions, Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches, Some applications of polynomial optimization in operations research and real-time decision making, Aspects of non-commutative function theory, Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets, A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding, Nonnegative Morse polynomial functions and polynomial optimization, Computing the distance between the linear matrix pencil and the completely positive cone, Moments and sums of squares for polynomial optimization and related problems, Completely positive tensor recovery with minimal nuclear value, Semidefinite representation of convex sets, Continuous multifacility ordered median location problems, Operator Positivstellensätze for noncommutative polynomials positive on matrix convex sets, Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity, Real algebraic geometry with a view toward systems control and free positivity. Abstracts from the workshop held April 6--12, 2014., About the Connes embedding conjecture, Tensor eigenvalue complementarity problems, Semidefinite representations for finite varieties, Stabilization of linear impulsive systems under dwell-time constraints: interval observer-based framework, On the complexity of Putinar's Positivstellensatz, Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity, Constructive proofs of some positivstellensätze for compact semialgebraic subsets of \(\mathbb R^{d }\), Discrete-time multi-scale systems, On the complexity of Schmüdgen's Positivstellensatz, Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions, Partitioning procedure for polynomial optimization, An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones, An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization, SOS approximations of nonnegative polynomials via simple high degree perturbations, Observer synthesis under time-varying sampling for Lipschitz nonlinear systems, Generating exact nonlinear ranking functions by symbolic-numeric hybrid method, POS3POLY -- a MATLAB preprocessor for optimization with positive polynomials, Optimality conditions and finite convergence of Lasserre's hierarchy, Equality-constrained minimization of polynomial functions, Rank of Handelman hierarchy for Max-Cut, Positivstellensatz for homogeneous semialgebraic sets, Necessary global optimality conditions for nonlinear programming problems with polynomial constraints, Computation of correlated equilibrium with global-optimal expected social welfare, Positivstellensätze for real function algebras, Stability analysis and control of a class of LPV systems with piecewise constant parameters, Quantifying the unstable in linearized nonlinear systems, Moment vanishing problem and positivity: some examples, Copositive optimization -- recent developments and applications, Strict positivstellensätze for matrix polynomials with scalar constraints, Closures of quadratic modules, The convex Positivstellensatz in a free algebra, Positive polynomials on nondegenerate basic semi-algebraic sets, On the complexity of computing the handicap of a sufficient matrix, Robust portfolio optimization: a conic programming approach, Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms, Discriminants and nonnegative polynomials, On global optimizations with polynomials, Sum-of-squares for bounded rationality, Establishing robust stability of discrete-time systems with time-varying uncertainty: the Gram-SOS approach, A Kadison-Dubois representation for associative rings., Semidefinite programming for min-max problems and games, First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials, Stochastic 0-1 linear programming under limited distributional information, Approximating integrals of multivariate exponentials: A moment approach, The inverse function theorem and the Jacobian conjecture for free analysis, Archimedean operator-theoretic Positivstellensätze, The \(\mathcal A\)-truncated \(K\)-moment problem, Proving inequalities and solving global optimization problems via simplified CAD projection, A generalization of Löwner-John's ellipsoid theorem, Sums of squares based approximation algorithms for MAX-SAT, Convergence rates of moment-sum-of-squares hierarchies for optimal control problems, Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets, A multiple-comparison-systems method for distributed stability analysis of large-scale nonlinear systems, Simple approximations of semialgebraic sets and their applications to control, The singular bivariate quartic tracial moment problem, Tensor maximal correlation problems, The \(K\)-moment problem with densities, An analogue of the Riesz-Haviland theorem for the truncated moment problem, Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers, An improved semidefinite programming hierarchy for testing entanglement, The truncated K-moment problem for closure of open sets, Representation of real commutative rings, Certificates of convexity for basic semi-algebraic sets, Sparsity in sums of squares of polynomials, Trace-positive polynomials and the quartic tracial moment problem, Moment problem for symmetric algebras of locally convex spaces, A semidefinite programming approach to the generalized problem of moments, Positive polynomials on projective limits of real algebraic varieties, A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones, Mean squared error minimization for inverse moment problems, Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities, Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps, Approximation and Markov moment problem on concrete spaces, A Striktpositivstellensatz for measurable functions, Monotonically positive matrices, Linear optimization with cones of moments and nonnegative polynomials, Scale transform of discrete stationary signals, Numerical approaches for collaborative data processing, An algorithm for the global optimization of a class of continuous minimax problems, Solving polynomial optimization problems via the truncated tangency variety and sums of squares, 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, Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares, A dynamic inequality generation scheme for polynomial programming, Learning Dynamical Systems with Side Information, Separability of Hermitian tensors and PSD decompositions, On the effective Putinar's Positivstellensatz and moment approximation, Homogenization for polynomial optimization with unbounded sets, Universal continuous calculus for Su*‐algebras, Semidefinite Relaxation Methods for Tensor Absolute Value Equations, Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023, Distance to a constitutive tensor isotropy stratum by the Lasserre polynomial optimization method, Minimal energy configurations of bilayer plates as a polynomial optimization problem, Dehomogenization for completely positive tensors, A new scheme for approximating the weakly efficient solution set of vector rational optimization problems, Data-driven quadratic stabilization and LQR control of LTI systems, Rational Generalized Nash Equilibrium Problems, A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization, Invariant structure preserving functions and an Oka-Weil Kaplansky density type theorem, Stability analysis of sampled-data control systems with input saturation: a hybrid system approach, A utopia point method-based robust vector polynomial optimization scheme, Convex Relaxations of Integral Variational Problems: Pointwise Dual Relaxation and Sum-of-Squares Optimization, On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials, Generalized truncated moment problems with unbounded sets, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022, Pell's equation, sum-of-squares and equilibrium measures on a compact set, Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials, An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials, Rational certificates of non-negativity on semialgebraic subsets of cylinders, Second Order Conditions to Decompose Smooth Functions as Sums of Squares, Degree Bounds for Putinar’s Positivstellensatz on the Hypercube, Unnamed Item, Validating numerical semidefinite programming solvers for polynomial invariants, A topological method for finding invariant sets of continuous systems, Performance of convex underestimators in a branch-and-bound framework, Constrained trace-optimization of polynomials in freely noncommuting variables, Synthesizing Robust Domains of Attraction for State-Constrained Perturbed Polynomial Systems, Sparsity Structures for Koopman and Perron--Frobenius Operators, A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition, LP relaxations for a class of linear semi-infinite programming problems, SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems, Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets, Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields, kNN Classification with an Outlier Informative Distance Measure, Noncommutative Christoffel-Darboux kernels, Moment problem in infinitely many variables, Sharper and Simpler Nonlinear Interpolants for Program Verification, Unnamed Item, Linear Conic Optimization for Inverse Optimal Control, Convexifying Positive Polynomials and Sums of Squares Approximation, Characteristic polynomial assignment for plants with semialgebraic uncertainty: A robust diophantine equation approach, Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph, Minimizer Extraction in Polynomial Optimization Is Robust, Approximate super-resolution of positive measures in all dimensions, On the Exactness of Lasserre Relaxations for Compact Convex Basic Closed Semialgebraic Sets, Three-point bounds for energy minimization, Converging outer approximations to global attractors using semidefinite programming, The strong truncated Hamburger moment problem with and without gaps, Bilevel Polynomial Programs and Semidefinite Relaxation Methods, Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems, Stokes, Gibbs, and volume computation of semi-algebraic sets, On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity, Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets, Computation of Sum of Squares Polynomials from Data Points, Sum-of-squares chordal decomposition of polynomial matrix inequalities, Unnamed Item, Semidefinite Representation for Convex Hulls of Real Algebraic Curves, Real Radicals and Finite Convergence of Polynomial Optimization Problems, Convex generalized Nash equilibrium problems and polynomial optimization, Quadratic modules of polynomials in two variables, A converse sum of squares Lyapunov function for outer approximation of minimal attractor sets of nonlinear systems, Symmetric Tensor Nuclear Norms, Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations, Polynomial LPV approach to robust H control of nonlinear sampled-data systems, A semidefinite method for tensor complementarity problems, Bounding extrema over global attractors using polynomial optimisation, Computing the Hausdorff Boundary Measure of Semialgebraic Sets, DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization, Computable Primal and Dual Bounds for Stochastic Control, Sum-of-Squares Optimization without Semidefinite Programming, A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis, Infinite dimensional moment problem: open questions and applications, A new proof for the existence of degree bounds for Putinar’s Positivstellensatz, Hermitian Tensor Decompositions, TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity, Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables, 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, Positive polynomials and sequential closures of quadratic modules, An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming, A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization, Robust stabilisation of polynomial systems with uncertain parameters, Polynomial relaxation-based conditions for global asymptotic stability of equilibrium points of genetic regulatory networks, Polynomials nonnegative on a grid and discrete optimization, New upper bounds for kissing numbers from semidefinite programming, Optimizing ordered median functions with applications to single facility location, Coarse-Convex-Compactification Approach to Numerical Solution of Nonconvex Variational Problems, On the moment problem of closed semi-algebraic sets, On robust stability of uncertain systems with multiple time-delays, The CP-Matrix Approximation Problem, A strict Positivstellensatz for enveloping algebras, Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems, LMI relaxations in robust control, Noncommutative polynomials nonnegative on a variety intersect a convex set, Best Nonnegative Rank-One Approximations of Tensors, The truncated complex $K$-moment problem, PRICING A CLASS OF EXOTIC OPTIONS VIA MOMENTS AND SDP RELAXATIONS, Introduction to Semidefinite, Conic and Polynomial Optimization, Semidefinite Representation of Convex Sets and Convex Hulls, A “Joint+Marginal” Approach in Optimization, Convexity and Semidefinite Programming in Dimension-Free Matrix Unknowns, Positivity and Optimization: Beyond Polynomials, Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems, SDP Relaxations for Non-Commutative Polynomial Optimization, Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes, Relative Entropy Relaxations for Signomial Optimization, Algebraic properties of Hermitian sums of squares, Finding Extremal Periodic Orbits with Polynomial Optimization, with Application to a Nine-Mode Model of Shear Flow, A Matrix Positivstellensatz with Lifting Polynomials, Stochastic polynomial optimization, Positive Maps and Separable Matrices, Moment methods in energy minimization: New bounds for Riesz minimal energy problems, Size-degree trade-offs for sums-of-squares and positivstellensatz proofs, On solving a class of linear semi-infinite programming by SDP method, Bounding Extreme Events in Nonlinear Dynamics Using Convex Optimization, Exact Algorithms for Linear Matrix Inequalities, Exact Semidefinite Programming Bounds for Packing Problems, The $\mathbf {K}$-moment problem for continuous linear functionals, Designing parametric linear quadratic regulators for parametric LTI systems via LMIs, Semidefinite Programming and Nash Equilibria in Bimatrix Games, Approximating amoebas and coamoebas by sums of squares, Semidefinite Programming For Chance Constrained Optimization Over Semialgebraic Sets, Convex Hulls of Quadratically Parameterized Sets With Quadratic Constraints, Semidefinite Representations of Noncompact Convex Sets, A unified framework of SAGE and SONC polynomials and its duality theory, Non-existence of degree bounds for weighted sums of squares representations, Positivstellensätze for noncommutative rational expressions, Global Stability Analysis of Nonlinear Sampled-Data Systems Using Convex Methods, Formal Proofs for Nonlinear Optimization, Nonconservative LMI techniques for robust stabilisation of spatially interconnected systems