Outer-product-free sets for polynomial optimization and oracle-based cuts
type: Item
instance of: scholarly article
title: Outer-product-free sets for polynomial optimization and oracle-based cuts
zbMATH Open document ID: 1450.90024
author: Chen Chen
author: Gonzalo Muñoz
author: Daniel Bienstock
published in: Mathematical Programming. Series A. Series B
publication date: 2020-08-28T00:00:00Z
full work available at URL: https://arxiv.org/abs/1610.04604
Mathematics Subject Classification ID: 90C23
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7241650
zbMATH Keywords: polynomial optimization
zbMATH Keywords: intersection cuts
zbMATH Keywords: cutting planes
zbMATH Keywords: \(S\)-free sets
describes a project that uses: GLOBALLib
describes a project that uses: Eigen
describes a project that uses: GloMIQO
describes a project that uses: QuadProgBB
describes a project that uses: quadprogIP
MaRDI profile type: Publication
OpenAlex ID: W3008300991
arXiv ID: 1610.04604
cites work: Intersection Cuts for Mixed Integer Conic Quadratic Sets
cites work: An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
cites work: Inequalities from Two Rows of a Simplex Tableau
cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
cites work: Conic mixed-integer rounding cuts
cites work: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
cites work: Intersection Cuts—A New Type of Cutting Planes for Integer Programming
cites work: Disjunctive programming: Properties of the convex hull of feasible points
cites work: Optimizing over the split closure
cites work: Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
cites work: Maximal Lattice-Free Convex Sets in Linear Subspaces
cites work: Minimal Inequalities for an Infinite Relaxation of Integer Programs
cites work: Convex Sets and Minimal Sublinear Functions
cites work: On families of quadratic surfaces having fixed intersections with two hyperplanes
cites work: Mixed-integer nonlinear optimization
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
cites work: Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
cites work: Minimal Valid Inequalities for Integer Constraints
cites work: Optimizing a polyhedral-semidefinite relaxation of completely positive programs
cites work: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
cites work: Globally solving nonconvex quadratic programming problems via completely positive programming
cites work: Edmonds polytopes and a hierarchy of combinatorial problems
cites work: Cut-Generating Functions and S-Free Sets
cites work: Equivalence between intersection cuts and the corner polyhedron
cites work: Sufficiency of cut-generating functions
cites work: The split closure of a strictly convex body
cites work: On convergence in mixed integer programming
cites work: Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
cites work: Constrained Infinite Group Relaxations of MIPs
cites work: A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
cites work: Optimizing over the first Chvátal closure
cites work: A note on the selection of Benders' cuts
cites work: On the complexity of four polyhedral set containment problems
cites work: A dynamic inequality generation scheme for polynomial programming
cites work: Polyhedral convexity cuts and negative edge extensions
cites work: Outline of an algorithm for integer solutions to linear programs
cites work: Q5645210
cites work: Some continuous functions related to corner polyhedra
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Computing a nearest symmetric positive semidefinite matrix
cites work: Reverse convex programming
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: On minimal valid inequalities for mixed integer conic programs
cites work: Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
cites work: Choosing the best set of variables in regression analysis using integer programming
cites work: A unifying framework for several cutting plane methods for semidefinite programming
cites work: Global optimization with polynomials and the problem of moments
cites work: Q3601990
cites work: Cook, Kannan and Schrijver's example revisited
cites work: On convex envelopes for bivariate functions over polytopes
cites work: Finite exact branch-and-bound algorithms for concave minimization over polytopes
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: Some results on the strength of relaxations of multilinear functions

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Aggregation and Mixed Integer Rounding to Solve MIPs

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Split cuts and extended formulations for mixed integer conic quadratic programming

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Intersection cuts for nonlinear integer programming: convexification techniques for structured sets

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Cone adaptation strategies for a finite and exact cutting plane algorithm for concave minimization

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Linear Programming Relaxations of Quadratically Constrained Quadratic Programs

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: A convex envelope formula for multilinear functions

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Convex Analysis

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Convex Bodies The Brunn-MinkowskiTheory

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Q3818127

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Intersection cuts for factorable MINLP

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Enhancing RLT relaxations via a new class of semidefinite cuts

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Q3802887

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Existence and sum decomposition of vertex polyhedral convex envelopes

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Explicit convex and concave envelopes through polyhedral subdivisions

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Convex extensions and envelopes of lower semi-continuous functions

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: A polyhedral branch-and-cut approach to global optimization

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: New solution approaches for the maximum-reliability stochastic network interdiction problem

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: Q5342287

Outer-product-free sets for polynomial optimization and oracle-based cuts (cites work)
cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints

Outer-product-free sets for polynomial optimization and oracle-based cuts (DOI)
DOI: 10.1007/S10107-020-01484-3