An iterative scheme for valid polynomial inequality generation in binary polynomial programming
From MaRDI portal
Recommendations
- A dynamic inequality generation scheme for polynomial programming
- Generating valid linear inequalities for nonlinear programs via sums of squares
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
- Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
- New SDP relaxations for unconstrained 0-1 polynomial programming problems
Cites work
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1984325 (Why is no real title available?)
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Survey of the S-Lemma
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
- Approximation of the stability number of a graph via copositive programming
- Bounds for the quadratic assignment problem using the bundle method
- Class of global minimum bounds of polynomial functions
- Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
- Exploiting equalities in polynomial programming
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Exploiting group symmetry in truss topology optimization
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Global optimization with polynomials and the problem of moments
- Handbook of semidefinite programming. Theory, algorithms, and applications
- LMI Approximations for Cones of Positive Semidefinite Forms
- Minimizing polynomials via sum of squares over the gradient ideal
- Recognizing underlying sparsity in optimization
- Reduction of symmetric semidefinite programs using the regular -representation
- Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- Semidefinite programming and integer programming
- Semidefinite programming relaxations for semialgebraic problems
- Semidefinite relaxations of ordering problems
- Semidefinite representations for finite varieties
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Sparsity in sums of squares of polynomials
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Symmetry groups, semidefinite programs, and sums of squares
- The quadratic knapsack problem -- a survey
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(3)
This page was built for publication: An iterative scheme for valid polynomial inequality generation in binary polynomial programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3009764)
