Outer-product-free sets for polynomial optimization and oracle-based cuts
From MaRDI portal
Publication:2196293
DOI10.1007/s10107-020-01484-3zbMath1450.90024arXiv1610.04604OpenAlexW3008300991MaRDI QIDQ2196293
Gonzalo Muñoz, Chen Chen, Bienstock, Daniel
Publication date: 28 August 2020
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.04604
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Polynomial optimization (90C23)
Related Items (18)
Maximal Quadratic-Free Sets ⋮ On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations ⋮ Intersection Disjunctions for Reverse Convex Sets ⋮ Cutting Plane Generation through Sparse Principal Component Analysis ⋮ Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem ⋮ Monoidal strengthening and unique lifting in MIQCPs ⋮ Towards a characterization of maximal quadratic-free sets ⋮ (Global) optimization: historical notes and recent developments ⋮ Generating valid linear inequalities for nonlinear programs via sums of squares ⋮ Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem ⋮ A branch-and-cut algorithm for mixed-integer bilinear programming ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ On tackling reverse convex constraints for non-overlapping of unequal circles ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ On a generalization of the Chvátal-Gomory closure ⋮ Maximal quadratic-free sets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dynamic inequality generation scheme for polynomial programming
- Sufficiency of cut-generating functions
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- On convergence in mixed integer programming
- Choosing the best set of variables in regression analysis using integer programming
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Conic mixed-integer rounding cuts
- Optimizing over the first Chvátal closure
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Cook, Kannan and Schrijver's example revisited
- Equivalence between intersection cuts and the corner polyhedron
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Computing a nearest symmetric positive semidefinite matrix
- Partitioning procedures for solving mixed-variables programming problems
- Reverse convex programming
- The ellipsoid method and its consequences in combinatorial optimization
- Disjunctive programming: Properties of the convex hull of feasible points
- A convex envelope formula for multilinear functions
- Convex extensions and envelopes of lower semi-continuous functions
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A polyhedral branch-and-cut approach to global optimization
- Split cuts and extended formulations for mixed integer conic quadratic programming
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Cone adaptation strategies for a finite and exact cutting plane algorithm for concave minimization
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Some results on the strength of relaxations of multilinear functions
- Explicit convex and concave envelopes through polyhedral subdivisions
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- The split closure of a strictly convex body
- Intersection cuts for factorable MINLP
- On families of quadratic surfaces having fixed intersections with two hyperplanes
- On convex envelopes for bivariate functions over polytopes
- Optimizing over the split closure
- Edmonds polytopes and a hierarchy of combinatorial problems
- A note on the selection of Benders' cuts
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Global Optimization with Polynomials and the Problem of Moments
- On Minimal Valid Inequalities for Mixed Integer Conic Programs
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Convex Sets and Minimal Sublinear Functions
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
- Constrained Infinite Group Relaxations of MIPs
- Minimal Inequalities for an Infinite Relaxation of Integer Programs
- Minimal Valid Inequalities for Integer Constraints
- An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
- Maximal Lattice-Free Convex Sets in Linear Subspaces
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
- Outline of an algorithm for integer solutions to linear programs
- The Cutting-Plane Method for Solving Convex Programs
- SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A unifying framework for several cutting plane methods for semidefinite programming
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- Aggregation and Mixed Integer Rounding to Solve MIPs
- On the complexity of four polyhedral set containment problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- Polyhedral convexity cuts and negative edge extensions
- Intersection Cuts for Mixed Integer Conic Quadratic Sets
- Cut-Generating Functions and S-Free Sets
- Convex Bodies The Brunn-MinkowskiTheory
- Mixed-integer nonlinear optimization
- Inequalities from Two Rows of a Simplex Tableau
- Convex Analysis
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Some continuous functions related to corner polyhedra
- Finite exact branch-and-bound algorithms for concave minimization over polytopes
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
This page was built for publication: Outer-product-free sets for polynomial optimization and oracle-based cuts
