Handling separable non-convexities using disjunctive cuts

DOI10.1007/978-3-030-53262-8_9MaRDI QIDQ2225053zbMATH OpenOpenAlexFDO

Authors Claudia D'Ambrosio, Jon Lee, Daphne Skipper, Dimitri Thomopulos

Publication date 4 February 2021

Full work available at URL https://doi.org/10.1007/978-3-030-53262-8_9

zbMATH Keywords

disjunctive cutsMINLPseparable non-convexity

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• Disjunctive Cuts for Nonconvex MINLP
• An algorithmic framework for MINLP with separable non-convexity
• A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
• Disjunctive cuts for mixed integer nonlinear programming problems
• Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs

Cited in

(6)

• A convex-analysis perspective on disjunctive cuts
• Disjunctive Cuts for Nonconvex MINLP
• An algorithmic framework for MINLP with separable non-convexity
• A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
• Strengthening lattice-free cuts using non-negativity
• On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs

This page was built for publication: Handling separable non-convexities using disjunctive cuts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225053)