Moments and sums of squares for polynomial optimization and related problems
From MaRDI portal
Publication:842714
DOI10.1007/s10898-008-9394-7zbMath1177.90324OpenAlexW1977828554MaRDI QIDQ842714
Publication date: 25 September 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9394-7
Related Items
Continuous multifacility ordered median location problems, Generating cutting planes for the semidefinite relaxation of quadratic programs, Chebyshev model arithmetic for factorable functions, Completely positive reformulations of polynomial optimization problems with linear constraints, Rejoinder on: ``Distance geometry and data science, Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms, Semidefinite programming for min-max problems and games, Global optimality conditions and optimization methods for polynomial programming problems, Tensor \(Z\)-eigenvalue complementarity problems, The truncated Hamburger moment problems with gaps in the index set, Alternative SDP and SOCP approximations for polynomial optimization, Mathematical programming formulations for the alternating current optimal power flow problem, Mathematical programming formulations for the alternating current optimal power flow problem, A mixed PI/VI design method for nonlinear H∞ Control, Equilibrium problems involving the Lorentz cone, A semidefinite programming approach for solving multiobjective linear programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- SOS approximations of nonnegative polynomials via simple high degree perturbations
- A semidefinite programming approach to the generalized problem of moments
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Exponentially bounded positive definite functions
- The \(K\)-moment problem for compact semi-algebraic sets
- Solving zero-dimensional systems through the rational univariate representation
- An independent benchmarking of SDP and SOCP solvers
- Semidefinite programming relaxations for semialgebraic problems
- Stable normal forms for polynomial system solving
- There are significantly more nonnegative polynomials than sums of squares
- Global optimization of rational functions: a semidefinite programming approach
- Quasi-analytic vectors
- Global Optimization with Polynomials and the Problem of Moments
- Distinguished representations of strictly positive polynomials
- GloptiPoly 3: moments, optimization and semidefinite programming
- On the relation between the multidimensional moment problem and the one-dimensional moment problem.
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Algorithm 795
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Optimisation globale et théorie des moments
- The truncated complex $K$-moment problem
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- GloptiPoly
- Revisiting two theorems of Curto and Fialkow on moment matrices
- Sum of Squares Approximation of Polynomials, Nonnegative on a Real Algebraic Set
- A Sum of Squares Approximation of Nonnegative Polynomials
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Global Optimization and Constraint Satisfaction
