Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
A hierarchy of relaxations for linear generalized disjunctive programming
A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
Mixed-integer nonlinear programs featuring ``on/off constraints
Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
Relative entropy optimization and its applications
Reformulations for utilizing separability when solving convex MINLP problems
A strong conic quadratic reformulation for machine-job assignment with controllable processing times
An algorithmic framework for convex mixed integer nonlinear programs
Representability in mixed integer programming. I: Characterization results
Disjunctive programming: Properties of the convex hull of feasible points
Solving mixed integer nonlinear programs by outer approximation
Generalized convex disjunctive programming: Nonlinear convex hull relaxation
Second-order cone programming
Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming
Modeling languages in mathematical optimization.
A hybrid LP/NLP paradigm for global optimization relaxations
Strong formulations for quadratic optimization with M-matrices and indicator variables
Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
A polyhedral branch-and-cut approach to global optimization
Polyhedral approximation in mixed-integer convex optimization
A branch-and-cut method for 0-1 mixed convex programming
Convex programming for disjunctive convex optimization
Outer approximation with conic certificates for mixed-integer convex problems
PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
Small and strong formulations for unions of convex sets from the Cayley embedding
On mathematical programming with indicator constraints
Mixed-integer convex representability
Perspective cuts for a class of convex 0-1 mixed integer programs
Generalized Benders decomposition
Cuts for mixed 0-1 conic programming
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Lectures on Modern Convex Optimization
On Minimal Valid Inequalities for Mixed Integer Conic Programs
MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
Extended Formulations in Mixed-Integer Convex Programming
Cutting Plane Algorithm for Convex Generalized Disjunctive Programs
Integer Programming
Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Disjunctive Programming
Robust Solutions to Least-Squares Problems with Uncertain Data
Disjunctive Programming
Improving the performance of DICOPT in convex MINLP problems using a feasibility pump
Solving Natural Conic Formulations with Hypatia.jl
MathOptInterface: A Data Structure for Mathematical Optimization Problems
Undecidability and hardness in mixed-integer nonlinear programming
A tree-search algorithm for mixed integer programming problems

This page was built for publication: Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones