A dynamic inequality generation scheme for polynomial programming

DOI10.1007/S10107-015-0870-9zbMATH Open1342.90143OpenAlexW1988815259MaRDI QIDQ263184FDOQ263184

Authors: Bissan Ghaddar, Miguel F. Anjos, Juan Vera 

Publication date: 4 April 2016

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/85927332/A_Dynamic_Inequality_Generation_Scheme_for_Polynomial_Programming.pdf

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

zbMATH Keywords

semidefinite programmingbinary polynomial programminginequality generationpolynomial programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Nonlinear programming (90C30) Semidefinite programming (90C22)

Cites Work

• The quadratic knapsack problem -- a survey
• A Survey of the S-Lemma
• Global optimization with polynomials and the problem of moments
• Recognizing underlying sparsity in optimization
• Exploiting group symmetry in truss topology optimization
• Exploiting special structure in semidefinite programming: a survey of theory and applications
• Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
• Semidefinite programming relaxations for semialgebraic problems
• Symmetry groups, semidefinite programs, and sums of squares
• Application of cut polyhedra. I
• Applications of cut polyhedra. II
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Minimizing polynomials via sum of squares over the gradient ideal
• An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
• Approximation of the stability number of a graph via copositive programming
• Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Title not available (Why is that?)
• Sums of squares, moment matrices and optimization over polynomials
• Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
• Class of global minimum bounds of polynomial functions
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Title not available (Why is that?)
• Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
• LMI Approximations for Cones of Positive Semidefinite Forms
• The proof of Tchakaloff’s Theorem
• Semidefinite Programming vs. LP Relaxations for Polynomial Programming
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
• Semidefinite representations for finite varieties
• Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
• Exploiting equalities in polynomial programming

Cited In (11)

• Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
• An iterative scheme for valid polynomial inequality generation in binary polynomial programming
• Exploiting equalities in polynomial programming
• A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
• Outer-product-free sets for polynomial optimization and oracle-based cuts
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
• Alternative SDP and SOCP approximations for polynomial optimization
• Partial Lasserre relaxation for sparse Max-Cut
• Generating convex polynomial inequalities for mixed 0-1 programs
• Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
• Generating valid linear inequalities for nonlinear programs via sums of squares

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)