Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (original) (raw)
Related papers
Journal of Optimization Theory and Applications, 2015
Lagrangian-Conic Relaxations, Part II: Applications to Polynomial Optimization Problems
A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
Masakazu Muramatsu, Masakazu Kojima
Computational Optimization and Applications, 2009
A general framework for convex relaxation of polynomial optimization problems over cones
2003
Binary quadratic optimization problems that are difficult to solve by conic relaxations
Discrete Optimization, 2017
Masakazu Muramatsu, Masakazu Kojima
SIAM Journal on Optimization, 2006
Mathematical Programming, 2015
Convexification of box-constrained polynomial optimization problems via monomial patterns
Cornell University - arXiv, 2019
Equality Based Contraction of Semidefinite Programming Relaxations in Polynomial Optimization
Journal of the Operations Research Society of Japan, 2008
Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
Siam Journal on Optimization, 2011
Masakazu Muramatsu, Masakazu Kojima
2008
SDP RELAXATIONS FOR QUADRATIC OPTIMIZATION PROBLEMS DERIVED FROM POLYNOMIAL OPTIMIZATION PROBLEMS
2010
An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones
Masakazu Muramatsu, Masakazu Kojima
Mathematical Programming, 2007
SIAM Journal on Optimization, 2005
Perturbed sums-of-squares theorem for polynomial optimization and its applications
Optimization Methods and Software, 2015
Compact Relaxations for Polynomial Programming Problems
Lecture Notes in Computer Science, 2012
Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
SIAM Journal on Optimization, 2006
Moments and sums of squares for polynomial optimization and related problems
Journal of Global Optimization, 2009
BOXCQP: an algorithm for bound constrained convex quadratic problems
2004
Semidefinite Relaxation of Quadratic Optimization Problems
IEEE Signal Processing Magazine, 2010
CS-TSSOS: Correlative and Term Sparsity for Large-Scale Polynomial Optimization
ACM Transactions on Mathematical Software
Bilinear optimality constraints for the cone of positive polynomials
Mathematical Programming, 2011
Bound-Constrained Polynomial Optimization Using Only Elementary Calculations
Mathematics of Operations Research
Decomposition-based Method for Sparse Semidefinite Relaxations of Polynomial Optimization Problems
Journal of Optimization Theory and Applications, 2010
On standard quadratic programs with exact and inexact doubly nonnegative relaxations
Mathematical Programming, 2021
arXiv (Cornell University), 2019
2007
Second order cone programming relaxation of nonconvex quadratic optimization problems
Optimization Methods and Software, 2001
Sums of Squares Relaxations of Polynomial Semidefinite Programs
2003
A robust Lagrangian-DNN method for a class of quadratic optimization problems
Computational Optimization and Applications, 2016
Sum-of-Squares Hierarchies for Binary Polynomial Optimization
Integer Programming and Combinatorial Optimization, 2021
Using Semidefinite Programming to Minimize Polynomials
2001