Perturbed sums-of-squares theorem for polynomial optimization and its applications
From MaRDI portal
Publication:2811486
DOI10.1080/10556788.2015.1052969zbMath1381.90065arXiv1304.0065MaRDI QIDQ2811486
Masakazu Muramatsu, Tunçel, Levent, Hayato Waki
Publication date: 10 June 2016
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.0065
Related Items
Cites Work
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Lower bounds on the global minimum of a polynomial
- A facial reduction algorithm for finding sparse SOS representations
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
- SOS approximations of nonnegative polynomials via simple high degree perturbations
- Regularizing the abstract convex program
- Global minimization of a multivariate polynomial using matrix methods
- Semidefinite programming relaxations for semialgebraic problems
- Sparsity in sums of squares of polynomials
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
- A note on the representation of positive polynomials with structured sparsity
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Global Optimization with Polynomials and the Problem of Moments
- Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization
- Lower Bounds for Polynomials Using Geometric Programming
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- 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