The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming

DOI10.1007/s10898-015-0322-3zbMath1339.90247MaRDI QIDQ5964241

Tapio Westerlund, Andreas Lundell, Jan Kronqvist

Publication date: 29 February 2016

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-015-0322-3

zbMATH Keywords

cutting planes; convex mixed integer nonlinear programming; extended cutting plane algorithm; extended supporting hyperplane algorithm; supporting hyperplane optimization toolkit; supporting hyperplanes

Mathematics Subject Classification ID

90C25: Convex programming

90C11: Mixed integer programming

Related Items

Conflict Analysis for MINLP, Using projected cutting planes in the extended cutting plane method, Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts, Fill‐rate service level constrained distribution network design, Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs, Distributed primal outer approximation algorithm for sparse convex programming with separable structures, SHOT, Reformulations for utilizing separability when solving convex MINLP problems, Reformulating the disjunctive cut generating linear program, On solving generalized convex MINLP problems using supporting hyperplane techniques, Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems, Outer approximation for integer nonlinear programs via decision diagrams, A proximal-point outer approximation algorithm, Preprocessing and cutting planes with conflict graphs, Branch-and-price for a class of nonconvex mixed-integer nonlinear programs, A choice-based optimization approach for contracting in supply chains, Alternative regularizations for outer-approximation algorithms for convex MINLP, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization, Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, A disjunctive cut strengthening technique for convex MINLP, On decomposition and multiobjective-based column and disjunctive cut generation for MINLP, The supporting hyperplane optimization toolkit for convex MINLP, The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming, An overview of MINLP algorithms and their implementation in Muriqui optimizer, On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm, Using regularization and second order information in outer approximation for convex MINLP, On the approximation of unbounded convex sets by polyhedra, Two linear approximation algorithms for convex mixed integer nonlinear programming, Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization

Uses Software

• BARON
• RROOT_748
• Bonmin
• MINLP
• Ipopt
• DICOPT
• AlphaECP
• OSiL
• ANTIGONE
• PAVER
• Algorithm 748

Cites Work

• Unnamed Item
• A reformulation framework for global optimization
• A review of recent advances in global optimization
• An algorithmic framework for convex mixed integer nonlinear programs
• Some transformation techniques with applications in global optimization
• Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
• BARON: A general purpose global optimization software package
• PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• OSiL: An instance language for optimization
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Generalized Benders decomposition
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• Global Optimization of Mixed-Integer Signomial Programming Problems
• Introduction to Nonsmooth Optimization
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Algorithm 748: enclosing zeros of continuous functions
• Survey of Bundle Methods for Nonsmooth Optimization
• On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
• The Supporting Hyperplane Method for Unimodal Programming
• A tree-search algorithm for mixed integer programming problems
• There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming