Publication:3601990
From MaRDI portal
zbMath1163.13021MaRDI QIDQ3601990
Publication date: 12 February 2009
90C22: Semidefinite programming
90C30: Nonlinear programming
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
14P10: Semialgebraic sets and related spaces
15A99: Basic linear algebra
13J25: Ordered rings
Related Items
Unnamed Item, Minimizer Extraction in Polynomial Optimization Is Robust, On the Exactness of Lasserre Relaxations for Compact Convex Basic Closed Semialgebraic Sets, Sampling Algebraic Varieties for Sum of Squares Programs, Real Radicals and Finite Convergence of Polynomial Optimization Problems, Extreme positive ternary sextics, Sum-of-Squares Optimization without Semidefinite Programming, Infinite dimensional moment problem: open questions and applications, A new proof for the existence of degree bounds for Putinar’s Positivstellensatz, Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables, LP Formulations for Polynomial Optimization Problems, Unnamed Item, The Running Intersection Relaxation of the Multilinear Polytope, Semidefinite Programming and Nash Equilibria in Bimatrix Games, A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems, The \(\mathcal{S}\)-cone and a primal-dual view on second-order representability, Tensor \(Z\)-eigenvalue complementarity problems, Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares, On exact Reznick, Hilbert-Artin and Putinar's representations, The truncated Hamburger moment problems with gaps in the index set, The dual cone of sums of non-negative circuit polynomials, The multidimensional truncated moment problem: Carathéodory numbers from Hilbert functions, On generalization in moment-based domain adaptation, Analysis of optimization algorithms via sum-of-squares, \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex, Outer-product-free sets for polynomial optimization and oracle-based cuts, Breaking symmetries to rescue sum of squares in the case of makespan scheduling, Hermitian completely positive matrices, Completely positive tensors in the complex field, Generating valid linear inequalities for nonlinear programs via sums of squares, On the complexity of testing attainment of the optimal value in nonlinear optimization, Generalized eigenvalue methods for Gaussian quadrature rules, Multivariate central limit theorems for random simplicial complexes, On solving a class of fractional semi-infinite polynomial programming problems, Exploiting term sparsity in noncommutative polynomial optimization, Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation, A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian, The full infinite dimensional moment problem on semi-algebraic sets of generalized functions, Robust SOS-convex polynomial optimization problems: exact SDP relaxations, A hierarchy of semidefinite relaxations for completely positive tensor optimization problems, Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials, On types of degenerate critical points of real polynomial functions, A semidefinite relaxation method for second-order cone polynomial complementarity problems, On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems, SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection, Higher-degree tensor eigenvalue complementarity problems, Test of copositive tensors, A semidefinite relaxation algorithm for checking completely positive separable matrices, Lower bounds on matrix factorization ranks via noncommutative polynomial optimization, Tight relaxations for polynomial optimization and Lagrange multiplier expressions, Set membership identification of switched linear systems with known number of subsystems, On an extension of Pólya's Positivstellensatz, Non-extremal sextic moment problems, A gentle, geometric introduction to copositive optimization, Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm, Error bounds for polynomial optimization over the hypercube using Putinar type representations, Quantum de Finetti theorems under local measurements with applications, A recursive algorithm of exactness verification of relaxations for robust SDPs, Stability analysis of networked control systems: a sum of squares approach, Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables, Computing generalized Nash equilibria by polynomial programming, The truncated moment problem on \(\mathbb{N}_0\), Error bounds for monomial convexification in polynomial optimization, On the spherical convexity of quadratic functions, Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools, A new approximation hierarchy for polynomial conic optimization, Certifying convergence of Lasserre's hierarchy via flat truncation, Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations, An operator-valued generalization of Tchakaloff's theorem, Cubic column relations in truncated moment problems, Noncommutative polynomials nonnegative on a variety intersect a convex set, Moment problem in infinitely many variables, On a minimal solution for the indefinite multidimensional truncated moment problem, A note on the Lasserre hierarchy for different formulations of the maximum independent set problem, The CP-Matrix Approximation Problem, Matrix convex hulls of free semialgebraic sets, Sums of squares and varieties of minimal degree, The Approach of Moments for Polynomial Equations, Convex Hulls of Algebraic Sets, Invariant Semidefinite Programs, Projection Methods in Conic Optimization, SDP Relaxations for Non-Commutative Polynomial Optimization, Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes, Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming, Positive Maps and Separable Matrices, Interpolant Synthesis for Quadratic Polynomial Inequalities and Combination with EUF, Flat extensions in ∗-algebras, Exact Algorithms for Linear Matrix Inequalities, Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations, Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization, Bounding Stationary Averages of Polynomial Diffusions via Semidefinite Programming, On New Classes of Nonnegative Symmetric Tensors, Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization, On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy, Sum of squares basis pursuit with linear and second order cone programming, How to integrate a polynomial over a simplex, Charges solve the truncated complex moment problem, Unnamed Item, A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis, On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy, Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares, A dynamic inequality generation scheme for polynomial programming, Minimizing the sum of many rational functions, Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors, Amoebas, nonnegative polynomials and sums of squares supported on circuits, A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure, Some applications of polynomial optimization in operations research and real-time decision making, On the construction of general cubature formula by flat extensions, Concepts and techniques of optimization on the sphere, Stability and genericity for semi-algebraic compact programs, 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, Operator Positivstellensätze for noncommutative polynomials positive on matrix convex sets, Global completability with applications to self-consistent quantum tomography, Real ideal and the duality of semidefinite programming for polynomial optimization, Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity, Moment approximations for set-semidefinite polynomials, Scaling relationship between the copositive cone and Parrilo's first level approximation, Optimality conditions and finite convergence of Lasserre's hierarchy, Rank of Handelman hierarchy for Max-Cut, Computation of correlated equilibrium with global-optimal expected social welfare, The convex Positivstellensatz in a free algebra, Linear control of time-domain constrained systems, The truncated moment problem via homogenization and flat extensions, Robust control of uncertain systems: classical results and recent developments, Dual semidefinite programs without duality gaps for a class of convex minimax programs, A Frank-Wolfe type theorem for nondegenerate polynomial programs, Design of Marx generators as a structured eigenvalue assignment, Separating inequalities for nonnegative polynomials that are not sums of squares, Handelman's hierarchy for the maximum stable set problem, On polynomial optimization over non-compact semi-algebraic sets, The cubic complex moment problem, The \(\mathcal A\)-truncated \(K\)-moment problem, A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals, A semidefinite algorithm for completely positive tensor decomposition, Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization, An improved semidefinite programming hierarchy for testing entanglement, Symmetric tensor decomposition, Partitioning procedure for polynomial optimization, A facial reduction algorithm for finding sparse SOS representations, Closures of quadratic modules, Semidefinite representation of convex hulls of rational varieties, Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems, On the complexity of computing the handicap of a sufficient matrix, Positive semidefinite diagonal minus tail forms are sums of squares, Further results on Cauchy tensors and Hankel tensors, Norm bounds and underestimators for unconstrained polynomial integer minimization, Approximation algorithms for nonnegative polynomial optimization problems over unit spheres, Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope, Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities, Linear optimization with cones of moments and nonnegative polynomials, Signomial and polynomial optimization via relative entropy and partial dualization, The subnormal completion problem in several variables, Interiors of completely positive cones, Real root finding for determinants of linear matrices, Extended formulation for CSP that is compact for instances of bounded treewidth, Many 2-level polytopes from matroids, A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming, Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems, A generalized flat extension theorem for moment matrices, Exploiting special structure in semidefinite programming: a survey of theory and applications, Positivity of Riesz functionals and solutions of quadratic and quartic moment problems, Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches, Polynomial-exponential decomposition from moments, Symmetry in Turán sums of squares polynomials from flag algebras, Completely positive tensor recovery with minimal nuclear value, A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem, Tensor eigenvalue complementarity problems, Completely positive reformulations of polynomial optimization problems with linear constraints, Symmetric sums of squares over \(k\)-subset hypercubes, Optimization approaches to quadrature: new characterizations of Gaussian quadrature on the line and quadrature with few nodes on plane algebraic curves, on the plane and in higher dimensions, The multidimensional truncated moment problem: Carathéodory numbers, The multidimensional truncated moment problem: atoms, determinacy, and core variety, Limitations of semidefinite programs for separable states and entangled games, Solving fractional multicriteria optimization problems with sum of squares convex polynomial data, Positive definiteness of paired symmetric tensors and elasticity tensors, The core variety of a multisequence in the truncated moment problem, The singular bivariate quartic tracial moment problem, Real eigenvalues of nonsymmetric tensors, Tensor maximal correlation problems, Compactness criteria for real algebraic sets and Newton polyhedra, Approximating the Pareto set of multiobjective linear programs via robust optimization, Extended formulations for vertex cover, Complex orthogonal polynomials and numerical quadrature via hyponormality, How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization, A semidefinite approach for truncated \(K\)-moment problems, Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization, Exact SDP relaxations for classes of nonlinear semidefinite programming problems, The tracial moment problem and trace-optimization of polynomials, Numerical algebraic geometry and semidefinite programming, A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials, A note on nondegenerate matrix polynomials, An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming, The tracial moment problem on quadratic varieties, An SDP method for copositivity of partially symmetric tensors, On the exactness of Lasserre relaxations and pure states over real closed fields, An introduction to matrix convex sets and free spectrahedra, A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs, Positive univariate trace polynomials, Unnamed Item, Unnamed Item, On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity, Certifying Unstability of Switched Systems Using Sum of Squares Programming, Computable Primal and Dual Bounds for Stochastic Control, Hermitian Tensor Decompositions, TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity, A Matrix Positivstellensatz with Lifting Polynomials, Stochastic polynomial optimization, The quintic complex moment problem, Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing, Generic Properties for Semialgebraic Programs, A Positivstellensatz for Sums of Nonnegative Circuit Polynomials, Symmetric Tensor Nuclear Norms, DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization, The multidimensional truncated moment problem: Gaussian and log-normal mixtures, their Carathéodory numbers, and set of atoms, Inhomogeneous polynomial optimization over a convex set: An approximation approach, Limits of positive flat bivariate moment matrices, Upper bounds for packings of spheres of several radii, Approximating amoebas and coamoebas by sums of squares, Semidefinite Programming For Chance Constrained Optimization Over Semialgebraic Sets, Well-Posedness in Unconstrained Polynomial Optimization Problems, Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization, Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design, Constrained trace-optimization of polynomials in freely noncommuting variables, Sum-of-squares hierarchies for binary polynomial optimization, Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces, High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts, The maximum tensor complementarity eigenvalues
Uses Software
