A dynamic inequality generation scheme for polynomial programming
From MaRDI portal
Publication:263184
DOI10.1007/s10107-015-0870-9zbMath1342.90143OpenAlexW1988815259MaRDI QIDQ263184
Bissan Ghaddar, Miguel F. Anjos, Juan Carlos 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
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Combinatorial optimization (90C27)
Related Items (6)
Partial Lasserre relaxation for sparse Max-Cut ⋮ 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 ⋮ A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs ⋮ Alternative SDP and SOCP approximations for polynomial optimization ⋮ Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- The quadratic knapsack problem -- a survey
- Exploiting equalities in polynomial programming
- 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
- Global Optimization with Polynomials and the Problem of Moments
- 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
- 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
- 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
- A Survey of the S-Lemma
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: A dynamic inequality generation scheme for polynomial programming
