Maximal quadratic-free sets
From MaRDI portal
Publication:2118125
DOI10.1007/s10107-021-01738-8zbMath1489.90098arXiv1911.12341OpenAlexW4206698249MaRDI QIDQ2118125
Publication date: 22 March 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.12341
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20)
Related Items (3)
Maximal Quadratic-Free Sets ⋮ Towards a characterization of maximal quadratic-free sets ⋮ On the implementation and strengthening of intersection cuts for QCQPs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sufficiency of cut-generating functions
- Cutting planes from extended LP formulations
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Motzkin decomposition of closed convex sets
- Two-term disjunctions on the second-order cone
- Equivalence between intersection cuts and the corner polyhedron
- Split cuts and extended formulations for mixed integer conic quadratic programming
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
- A branch-and-cut algorithm for mixed-integer bilinear programming
- Intersection cuts for polynomial optimization
- Intersection cuts for factorable MINLP
- On pathological disjunctions and redundant disjunctive conic cuts
- On families of quadratic surfaces having fixed intersections with two hyperplanes
- Global Optimization with Polynomials and the Problem of Moments
- On Minimal Valid Inequalities for Mixed Integer Conic Programs
- Constrained Infinite Group Relaxations of MIPs
- Minimal Inequalities for an Infinite Relaxation of Integer Programs
- On Maximal S-Free Convex Sets
- 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
- Intersection Cuts for Bilevel Optimization
- Integer Programming
- A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- ON A CRITERION FOR CONVEXITY OF A POSITIVE-HOMOGENEOUS FUNCTION
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Intersection Cuts for Mixed Integer Conic Quadratic Sets
- Maximal Quadratic-Free Sets
- The Convex Hull of a Quadratic Constraint over a Polytope
- Cut-Generating Functions and S-Free Sets
- Nonunique Lifting of Integer Variables in Minimal Inequalities
- 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
- Convexity Cuts and Cut Search
- On the implementation and strengthening of intersection cuts for QCQPs
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
This page was built for publication: Maximal quadratic-free sets
