A dynamic inequality generation scheme for polynomial programming
From MaRDI portal
Recommendations
- An iterative scheme for valid polynomial inequality generation in binary polynomial programming
- Generating valid linear inequalities for nonlinear programs via sums of squares
- Generating convex polynomial inequalities for mixed 0-1 programs
- Exploiting equalities in polynomial programming
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
Cites work
- scientific article; zbMATH DE number 3129782 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- 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 lift-and-project cutting plane algorithm for mixed 0-1 programs
- An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
- Application of cut polyhedra. I
- Applications of cut polyhedra. II
- Approximation of the stability number of a graph via copositive programming
- Class of global minimum bounds of polynomial functions
- Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- 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 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 \(\ast\)-representation
- Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- Semidefinite programming relaxations for semialgebraic problems
- Semidefinite representations for finite varieties
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Sums of squares, moment matrices and optimization over polynomials
- Symmetry groups, semidefinite programs, and sums of squares
- The proof of Tchakaloff’s Theorem
- The quadratic knapsack problem -- a survey
Cited in
(11)- Generating convex polynomial inequalities for mixed 0-1 programs
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- Alternative SDP and SOCP approximations for polynomial optimization
- An iterative scheme for valid polynomial inequality generation in binary polynomial programming
- Generating valid linear inequalities for nonlinear programs via sums of squares
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- Exploiting equalities in polynomial programming
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- Partial Lasserre relaxation for sparse Max-Cut
This page was built for publication: A dynamic inequality generation scheme for polynomial programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q263184)
