Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
From MaRDI portal
Recommendations
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Algorithmic approach for improved mixed-integer reformulations of convex generalized disjunctive programs
- Generalized disjunctive programming: solution strategies
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- Extended formulations in mixed-integer convex programming
Cites work
- scientific article; zbMATH DE number 6108474 (Why is no real title available?)
- A branch-and-cut method for 0-1 mixed convex programming
- A hierarchy of relaxations for linear generalized disjunctive programming
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- A hybrid LP/NLP paradigm for global optimization relaxations
- A polyhedral branch-and-cut approach to global optimization
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- A tree-search algorithm for mixed integer programming problems
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- 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
- Convex and scalable weakly labeled SVMs
- 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 Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Disjunctive programming
- Disjunctive programming: Properties of the convex hull of feasible points
- Extended formulations in mixed-integer convex programming
- Generalized Benders decomposition
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
- Improving the performance of DICOPT in convex MINLP problems using a feasibility pump
- Integer Programming
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- Mixed-integer convex representability
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Modeling languages in mathematical optimization.
- On mathematical programming with indicator constraints
- On minimal valid inequalities for mixed integer conic programs
- Outer approximation with conic certificates for mixed-integer convex problems
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Polyhedral approximation in mixed-integer convex optimization
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
- Reformulations for utilizing separability when solving convex MINLP problems
- Relative entropy optimization and its applications
- Representability in mixed integer programming. I: Characterization results
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Second-order cone programming
- Small and strong formulations for unions of convex sets from the Cayley embedding
- Solving Natural Conic Formulations with Hypatia.jl
- Solving mixed integer nonlinear programs by outer approximation
- Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Undecidability and hardness in mixed-integer nonlinear programming
Cited in
(2)
This page was built for publication: Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6498414)
