The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
From MaRDI portal
Publication:5964241
DOI10.1007/s10898-015-0322-3zbMath1339.90247MaRDI QIDQ5964241
Jan Kronqvist, Andreas Lundell, Tapio Westerlund
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
cutting planes; convex mixed integer nonlinear programming; extended cutting plane algorithm; extended supporting hyperplane algorithm; supporting hyperplane optimization toolkit; supporting hyperplanes
Related Items
SHOT, Reformulations for utilizing separability when solving convex MINLP problems, On solving generalized convex MINLP problems using supporting hyperplane techniques, Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems
Uses Software
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
