On the impact of running intersection inequalities for globally solving polynomial optimization problems

DOI10.1007/S12532-019-00169-ZzbMath1441.90097OpenAlexW2964874319WikidataQ127394096 ScholiaQ127394096MaRDI QIDQ2195679

Alberto Del Pia, Nikolaos V. Sahinidis, Aida Khajavirad

Publication date: 27 August 2020

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-019-00169-z

zbMATH Keywords

branch-and-cutpolynomial optimizationmixed-integer nonlinear optimizationseparation algorithmmultilinear polytoperunning-intersection inequalities

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items (8)

Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization ⋮ Complexity of optimizing over the integers ⋮ On the strength of recursive McCormick relaxations for binary polynomial optimization ⋮ Efficient linear reformulations for binary polynomial optimization problems ⋮ On the complexity of binary polynomial optimization over acyclic hypergraphs ⋮ A polyhedral study of lifted multicuts ⋮ A new framework to relax composite functions in nonlinear programs ⋮ The Running Intersection Relaxation of the Multilinear Polytope

Uses Software

• Unnamed Item
• Unnamed Item
• CPLEX
• LINDO
• LINDOGlobal
• ANTIGONE
• POLIP

Cites Work

• Unnamed Item
• Unnamed Item
• Quadratic reformulations of nonlinear binary optimization problems
• Concave extensions for nonlinear 0-1 maximization problems
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Experiments in quadratic 0-1 programming
• A polyhedral approach for nonconvex quadratic programming problems with box constraints
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
• A convex envelope formula for multilinear functions
• Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
• Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
• A hybrid LP/NLP paradigm for global optimization relaxations
• On decomposability of multilinear sets
• A class of valid inequalities for multilinear 0-1 optimization problems
• A polyhedral branch-and-cut approach to global optimization
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
• Explicit convex and concave envelopes through polyhedral subdivisions
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Global optimization of nonconvex problems with multilinear intermediates
• Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
• On the Desirability of Acyclic Database Schemes
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Branching and bounds tighteningtechniques for non-convex MINLP
• The global solver in the LINDO API
• Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
• Reducibility Among Combinatorial Problems
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• The Multilinear Polytope for Acyclic Hypergraphs
• LP Formulations for Polynomial Optimization Problems
• A Polyhedral Study of Binary Polynomial Programs
• Analysis of bounds for multilinear functions
• Benchmarking optimization software with performance profiles.

This page was built for publication: On the impact of running intersection inequalities for globally solving polynomial optimization problems