Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
From MaRDI portal
Recommendations
- Disjunctive cuts for mixed integer nonlinear programming problems
- Disjunctive cuts in mixed-integer conic optimization
- Disjunctive Cuts for Nonconvex MINLP
- A disjunctive cutting plane procedure for general mixed-integer linear programs
- Split cuts and extended formulations for mixed integer conic quadratic programming
- Cuts for Conic Mixed-Integer Programming
- scientific article; zbMATH DE number 3920195
- A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization
- An optimality cut for mixed integer linear programs
- Disjunctive cuts for continuous linear bilevel programming
Cites work
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A polyhedral study of nonconvex quadratic programs with box constraints
- An algorithmic framework for convex mixed integer nonlinear programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Disjunctive programming: Properties of the convex hull of feasible points
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- LaGO -- an object oriented library for solving MINLPs
- MIP reformulations of the probabilistic set covering problem
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimizing over the First Chvàtal Closure
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Relaxations for probabilistically constrained programs with discrete random variables
- Revival of the Gomory cuts in the 1990's
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(21)- Disjunctive cuts for continuous linear bilevel programming
- On minimal valid inequalities for mixed integer conic programs
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
- On the facet defining inequalities of the mixed-integer bilinear covering set
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- How to select a small set of diverse solutions to mixed integer programming problems
- Cardinality minimization, constraints, and regularization: a survey
- Computing deep facet-defining disjunctive cuts for mixed-integer programming
- Computing equilibria in discounted dynamic games
- Extending the QCR method to general mixed-integer programs
- Enhancements of Discretization Approaches for Non-Convex Mixed-Integer Quadratically Constraint Quadratic Programming: Part I
- Enhancements of Discretization Approaches for Non-Convex Mixed-Integer Quadratically Constraint Quadratic Programming: Part II
- Disjunctive Cuts for Nonconvex MINLP
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Convexification of bilinear forms through non-symmetric lifting
- Two-term disjunctions on the second-order cone
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Mixed integer programming with a class of nonlinear convex constraints
- The MILP road to MIQCP
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
This page was built for publication: Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503837)
