Small and strong formulations for unions of convex sets from the Cayley embedding
From MaRDI portal
Publication:2316612
DOI10.1007/s10107-018-1258-4zbMath1418.90180arXiv1704.03954OpenAlexW2963491246WikidataQ60168592 ScholiaQ60168592MaRDI QIDQ2316612
Publication date: 6 August 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.03954
Related Items
On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming ⋮ On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables ⋮ Ideal, non-extended formulations for disjunctive constraints admitting a network representation ⋮ Mixed-Integer Convex Representability ⋮ Outer approximation with conic certificates for mixed-integer convex problems ⋮ Strong mixed-integer programming formulations for trained neural networks ⋮ Balas formulation for the union of polytopes is optimal ⋮ Between steps: intermediate relaxations between big-M and convex hull formulations ⋮ Ideal formulations for constrained convex optimization problems with indicator variables ⋮ On generalized surrogate duality in mixed-integer nonlinear programming
Cites Work
- Unnamed Item
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- A simplification for some disjunctive formulations
- On the convex hull of the union of certain polyhedra
- Ubiquity of Łojasiewicz's example of a nonbasic semialgebraic set
- The Cayley trick, lifting subdivisions and the Bohne-Dress theorem on zonotopal tilings
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- Polyhedral approximation in mixed-integer convex optimization
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- On mathematical programming with indicator constraints
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Representation for multiple right-hand sides
- Lectures on Modern Convex Optimization
- Mixed Integer Linear Programming Formulation Techniques
- Extended Formulations in Mixed-Integer Convex Programming
- Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets
- Semidefinite Optimization and Convex Algebraic Geometry
- The maximum number of faces of the minkowski sum of three convex polytopes
