scientific article
From MaRDI portal
Publication:3601990
zbMath1163.13021MaRDI QIDQ3601990
Publication date: 12 February 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semidefinite programming (90C22) Nonlinear programming (90C30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Semialgebraic sets and related spaces (14P10) Basic linear algebra (15A99) Ordered rings (13J25)
Related Items
Quantum de Finetti theorems under local measurements with applications, Continuous-variable nonlocality and contextuality, Moment problem in infinitely many variables, A globally convergent method for solving a quartic generalized Markowitz portfolio problem, Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials, Bounding the separable rank via polynomial optimization, Quantum entanglement, symmetric nonnegative quadratic polynomials and moment problems, Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints, Sparse noncommutative polynomial optimization, Positivity certificates and polynomial optimization on non-compact semialgebraic sets, On a solution of the multidimensional truncated matrix-valued moment problem, A recursive algorithm of exactness verification of relaxations for robust SDPs, Stability analysis of networked control systems: a sum of squares approach, 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, Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables, Computing generalized Nash equilibria by polynomial programming, The saddle point problem of polynomials, An approximate characterisation of the set of feasible trajectories for constrained flat systems, The truncated moment problem on \(\mathbb{N}_0\), 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 multidimensional truncated moment problem: the moment cone, Error bounds for monomial convexification in polynomial optimization, Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints, On the spherical convexity of quadratic functions, The multidimensional truncated moment problem: Gaussian mixture reconstruction from derivatives of moments, The strong truncated Hamburger moment problem with and without gaps, Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools, A new approximation hierarchy for polynomial conic optimization, Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems, 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, Sum-of-squares chordal decomposition of polynomial matrix inequalities, Quadratic tensor eigenvalue complementarity problems, Mini-workshop: Interpolation, approximation, and algebra. Abstracts from the mini-workshop held February 13--19, 2022, Convex generalized Nash equilibrium problems and polynomial optimization, Finite-dimensional completion for the matrix-valued truncated complex moment problem, Certifying convergence of Lasserre's hierarchy via flat truncation, Loss functions for finite sets, On the complexity of testing attainment of the optimal value in nonlinear optimization, Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations, Generalized eigenvalue methods for Gaussian quadrature rules, Multivariate central limit theorems for random simplicial complexes, An operator-valued generalization of Tchakaloff's theorem, Cubic column relations in truncated moment problems, 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 semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems, The \(\mathcal{S}\)-cone and a primal-dual view on second-order representability, A hierarchy of semidefinite relaxations for completely positive tensor optimization problems, The CP-Matrix Approximation Problem, Matrix convex hulls of free semialgebraic sets, Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials, 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, On types of degenerate critical points of real polynomial functions, 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, Noncommutative polynomials nonnegative on a variety intersect a convex set, 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, Analysis of optimization algorithms via sum-of-squares, \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex, 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, Optimization over trace polynomials, The linearization problem of a binary quadratic problem and its applications, Lower bounds on matrix factorization ranks via noncommutative polynomial optimization, Tight relaxations for polynomial optimization and Lagrange multiplier expressions, Worst-case analysis of clique MIPs, Probability estimation via policy restrictions, convexification, and approximate sampling, Sparse interpolation in terms of multivariate Chebyshev polynomials, 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, Transformations of moment functionals, Distributionally robust optimization with moment ambiguity sets, 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, Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization, Maximal quadratic-free sets, Learning Dynamical Systems with Side Information, Further results on sum-of-squares tensors, Separability of Hermitian tensors and PSD decompositions, Maximal Quadratic-Free Sets, Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets, Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems, Noncommutative Christoffel-Darboux kernels, Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization, On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy, Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel, SOS Is Not Obviously Automatizable, Even Approximately, Functional norms, condition numbers and numerical algorithms in algebraic geometry, Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph, Minimizer Extraction in Polynomial Optimization Is Robust, Cutting Plane Generation through Sparse Principal Component Analysis, On the Exactness of Lasserre Relaxations for Compact Convex Basic Closed Semialgebraic Sets, Unnamed Item, Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism, Tangencies and polynomial optimization, Homogenization for polynomial optimization with unbounded sets, Rational dual certificates for weighted sums-of-squares polynomials with boundable bit size, A faster interior-point method for sum-of-squares optimization, Auxiliary functions as Koopman observables: data-driven analysis of dynamical systems via polynomial optimization, Bounding Stationary Averages of Polynomial Diffusions via Semidefinite Programming, New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023, Convergences for robust bilevel polynomial programmes with applications, A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization, Distance to a constitutive tensor isotropy stratum by the Lasserre polynomial optimization method, Globally trace-positive noncommutative polynomials and the unbounded tracial moment problem, A Sum of Squares Characterization of Perfect Graphs, Sampling Algebraic Varieties for Sum of Squares Programs, Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems, Dehomogenization for completely positive tensors, A new scheme for approximating the weakly efficient solution set of vector rational optimization problems, The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices, On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, Rational Generalized Nash Equilibrium Problems, Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks, A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization, Bootstrap, Markov chain Monte Carlo, and LP/SDP hierarchy for the lattice Ising model, Unnamed Item, Unnamed Item, Generic Properties for Semialgebraic Programs, Real Radicals and Finite Convergence of Polynomial Optimization Problems, On New Classes of Nonnegative Symmetric Tensors, Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization, A Positivstellensatz for Sums of Nonnegative Circuit Polynomials, Symmetric Tensor Nuclear Norms, Extreme positive ternary sextics, On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy, Unnamed Item, Sum of squares basis pursuit with linear and second order cone programming, Certifying Unstability of Switched Systems Using Sum of Squares Programming, Unnamed Item, 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, 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, LP Formulations for Polynomial Optimization Problems, 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, Unnamed Item, Unnamed Item, Constrained trace-optimization of polynomials in freely noncommuting variables, SDP Relaxations for Non-Commutative Polynomial Optimization, The Running Intersection Relaxation of the Multilinear Polytope, 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, Sum-of-squares hierarchies for binary polynomial optimization, A Matrix Positivstellensatz with Lifting Polynomials, Stochastic polynomial optimization, Positive Maps and Separable Matrices, Sum-of-squares hierarchies for binary polynomial optimization, How to integrate a polynomial over a simplex, The quintic complex moment problem, Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing, 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, Inhomogeneous polynomial optimization over a convex set: An approximation approach, Limits of positive flat bivariate moment matrices, Semidefinite Programming and Nash Equilibria in Bimatrix Games, 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, Charges solve the truncated complex moment problem, 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, On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate, Hausdorff distance between convex semialgebraic sets, Convex Relaxations of Integral Variational Problems: Pointwise Dual Relaxation and Sum-of-Squares Optimization, Data-driven optimal control via linear transfer operators: a convex approach, Generalized truncated moment problems with unbounded sets, On optimization problems in acyclic hypergraphs, A DCA-Newton method for quartic minimization over the sphere, Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases, On the complexity of binary polynomial optimization over acyclic hypergraphs, Low-Rank Univariate Sum of Squares Has No Spurious Local Minima, The Spectrum of the Grigoriev–Laurent Pseudomoments, Real tropicalization and negative faces of the Newton polytope, Degree Bounds for Putinar’s Positivstellensatz on the Hypercube, Unnamed Item, 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, Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches, A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure, Signomial and polynomial optimization via relative entropy and partial dualization, Some applications of polynomial optimization in operations research and real-time decision making, Polynomial-exponential decomposition from moments, 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, Symmetry in Turán sums of squares polynomials from flag algebras, Completely positive tensor recovery with minimal nuclear value, Operator Positivstellensätze for noncommutative polynomials positive on matrix convex sets, Global completability with applications to self-consistent quantum tomography, A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem, Real ideal and the duality of semidefinite programming for polynomial optimization, Tensor eigenvalue complementarity problems, Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity, Symmetric tensor decomposition, Partitioning procedure for polynomial optimization, Moment approximations for set-semidefinite polynomials, How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization, Completely positive reformulations of polynomial optimization problems with linear constraints, A semidefinite approach for truncated \(K\)-moment problems, A facial reduction algorithm for finding sparse SOS representations, Scaling relationship between the copositive cone and Parrilo's first level approximation, The subnormal completion problem in several variables, Optimality conditions and finite convergence of Lasserre's hierarchy, Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization, Rank of Handelman hierarchy for Max-Cut, Interiors of completely positive cones, Exact SDP relaxations for classes of nonlinear semidefinite programming problems, Real root finding for determinants of linear matrices, Computation of correlated equilibrium with global-optimal expected social welfare, The tracial moment problem and trace-optimization of polynomials, Extended formulation for CSP that is compact for instances of bounded treewidth, Symmetric sums of squares over \(k\)-subset hypercubes, Many 2-level polytopes from matroids, Closures of quadratic modules, 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 convex Positivstellensatz in a free algebra, Semidefinite representation of convex hulls of rational varieties, The multidimensional truncated moment problem: Carathéodory numbers, The multidimensional truncated moment problem: atoms, determinacy, and core variety, Linear control of time-domain constrained systems, Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems, On the complexity of computing the handicap of a sufficient matrix, 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, Positive semidefinite diagonal minus tail forms are sums of squares, Limitations of semidefinite programs for separable states and entangled games, 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, Further results on Cauchy tensors and Hankel tensors, Numerical algebraic geometry and semidefinite programming, A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials, 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, A semidefinite algorithm for completely positive tensor decomposition, Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization, Norm bounds and underestimators for unconstrained polynomial integer minimization, A note on nondegenerate matrix polynomials, An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming, The singular bivariate quartic tracial moment problem, Real eigenvalues of nonsymmetric tensors, Tensor maximal correlation problems, The tracial moment problem on quadratic varieties, Compactness criteria for real algebraic sets and Newton polyhedra, An improved semidefinite programming hierarchy for testing entanglement, Approximating the Pareto set of multiobjective linear programs via robust optimization, 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, 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, Approximation algorithms for nonnegative polynomial optimization problems over unit spheres, Extended formulations for vertex cover, Complex orthogonal polynomials and numerical quadrature via hyponormality, 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, 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, Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares, A dynamic inequality generation scheme for polynomial programming
Uses Software
