Disjunctive cuts in mixed-integer conic optimization
From MaRDI portal
Publication:6038657
Abstract: This paper studies disjunctive cutting planes in Mixed-Integer Conic Programming. Building on conic duality, we formulate a cut-generating conic program for separating disjunctive cuts, and investigate the impact of the normalization condition on its resolution. In particular, we show that a careful selection of normalization guarantees its solvability and conic strong duality. Then, we highlight the shortcomings of separating conic-infeasible points in an outer-approximation context, and propose conic extensions to the classical lifting and monoidal strengthening procedures. Finally, we assess the computational behavior of various normalization conditions in terms of gap closed, computing time and cut sparsity. In the process, we show that our approach is competitive with the internal lift-and-project cuts of a state-of-the-art solver.
Recommendations
- On the separation of disjunctive cuts
- A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization
- Cuts for Conic Mixed-Integer Programming
- Conic mixed-integer rounding cuts
- A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization
Cites work
- scientific article; zbMATH DE number 1757966 (Why is no real title available?)
- A branch-and-cut method for 0-1 mixed convex programming
- A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization
- A disjunctive cut strengthening technique for convex MINLP
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- An algorithmic framework for convex mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
- Conic mixed-integer rounding cuts
- Convex Analysis
- Convex programming for disjunctive convex optimization
- Cuts for mixed 0-1 conic programming
- Cutting plane algorithm for convex generalized disjunctive programs
- Disciplined convex programming
- Disjunctive Programming
- Disjunctive cuts for cross-sections of the second-order cone
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Extended formulations in mixed-integer convex programming
- Intersection cuts for mixed integer conic quadratic sets
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Lift-and-project cuts for mixed integer convex programs
- Lift-and-project for mixed 0-1 programming: recent progress
- Lifting for conic mixed-integer programming
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- On minimal valid inequalities for mixed integer conic programs
- On optimizing over lift-and-project closures
- On sublinear inequalities for mixed integer conic programs
- On the separation of disjunctive cuts
- Outer approximation with conic certificates for mixed-integer convex problems
- Polyhedral approximation in mixed-integer convex optimization
- Reflections on generating (disjunctive) cuts
- Reformulating the disjunctive cut generating linear program
- Split cuts and extended formulations for mixed integer conic quadratic programming
- Strengthening cuts for mixed integer programs
- The split closure of a strictly convex body
- Two-term disjunctions on the second-order cone
- ``Facet separation with one linear program
Cited in
(16)- Intersection cuts from multiple rows: a disjunctive programming approach
- Computing deep facet-defining disjunctive cuts for mixed-integer programming
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- Monoidal cut strengthening revisited
- A convex-analysis perspective on disjunctive cuts
- Disjunctive Cuts for Nonconvex MINLP
- An in-out approach to disjunctive optimization
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- On the separation of disjunctive cuts
- Disjunctive cuts for mixed integer nonlinear programming problems
- On pathological disjunctions and redundant disjunctive conic cuts
- Integer Programming and Combinatorial Optimization
- A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization
- Disjunctive cuts for continuous linear bilevel programming
This page was built for publication: Disjunctive cuts in mixed-integer conic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6038657)
