On the impact of running intersection inequalities for globally solving polynomial optimization problems
DOI10.1007/S12532-019-00169-ZzbMATH Open1441.90097OpenAlexW2964874319WikidataQ127394096 ScholiaQ127394096MaRDI QIDQ2195679FDOQ2195679
Authors: Alberto Del Pia, Aida Khajavirad, Nikolaos V. Sahinidis 
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
Recommendations
polynomial optimizationbranch-and-cutmixed-integer nonlinear optimizationseparation algorithmmultilinear polytoperunning-intersection inequalities
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Mixed integer programming (90C11)
Cites Work
- The global solver in the LINDO API
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- A polyhedral branch-and-cut approach to global optimization
- Explicit convex and concave envelopes through polyhedral subdivisions
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Quadratic reformulations of nonlinear binary optimization problems
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A convex envelope formula for multilinear functions
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- On the Desirability of Acyclic Database Schemes
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- A hybrid LP/NLP paradigm for global optimization relaxations
- Branching and bounds tighteningtechniques for non-convex MINLP
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- Analysis of bounds for multilinear functions
- Concave extensions for nonlinear 0-1 maximization problems
- Title not available (Why is that?)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Experiments in quadratic 0-1 programming
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- Reducibility among combinatorial problems
- Global optimization of nonconvex problems with multilinear intermediates
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- A class of valid inequalities for multilinear 0-1 optimization problems
- A polyhedral study of binary polynomial programs
- On decomposability of multilinear sets
- The multilinear polytope for acyclic hypergraphs
- LP formulations for polynomial optimization problems
Cited In (11)
- On the strength of recursive McCormick relaxations for binary polynomial optimization
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences
- On the complexity of binary polynomial optimization over acyclic hypergraphs
- A new framework to relax composite functions in nonlinear programs
- Efficient linear reformulations for binary polynomial optimization problems
- A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
- The Running Intersection Relaxation of the Multilinear Polytope
- A polyhedral study of lifted multicuts
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
- Complexity of optimizing over the integers
Uses Software
This page was built for publication: On the impact of running intersection inequalities for globally solving polynomial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2195679)
