An algorithmic framework for MINLP with separable non-convexity

DOI10.1007/978-1-4614-1927-3_11MaRDI QIDQ2897302zbMATH OpenOpenAlexFDO

Authors Claudia D'Ambrosio, Jon Lee, Andreas Wächter

Publication date 10 July 2012

Published in Mixed Integer Nonlinear Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4614-1927-3_11

zbMATH Keywords

global optimizationmixed-integer nonlinear programmingnon-convexseparablespatial branch-and-bound

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Mixed integer programming (90C11)

Recommendations

• A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
• Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
• Handling separable non-convexities using disjunctive cuts
• An Algorithm for Separable Nonconvex Programming Problems
• Algorithm for solution of convex MINLP problems

Cites work

• A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
• A Modeling Language for Mathematical Programming
• An algorithmic framework for convex mixed integer nonlinear programs
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• BARON: A general purpose global optimization software package
• Branching and bounds tighteningtechniques for non-convex MINLP
• LaGO -- an object oriented library for solving MINLPs
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Solving mixed integer nonlinear programs by outer approximation
• Writing global optimization software

Cited in

(12)

• Valid inequalities for separable concave constraints with indicator variables
• Algorithm for solution of convex MINLP problems
• A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
• Reformulations for utilizing separability when solving convex MINLP problems
• Handling separable non-convexities using disjunctive cuts
• scientific article; zbMATH DE number 2068060 (Why is no real title available?)
• Strengthening the sequential convex MINLP technique by perspective reformulations
• A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables
• An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
• Sequence of polyhedral relaxations for nonlinear univariate functions
• An Algorithm for Separable Nonconvex Programming Problems
• On global optimization with indefinite quadratics

Describes a project that uses

Uses Software

• LaGO
• Bonmin
• Ipopt

This page was built for publication: An algorithmic framework for MINLP with separable non-convexity

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