The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
From MaRDI portal
Publication:5964241
DOI10.1007/s10898-015-0322-3zbMath1339.90247OpenAlexW805566928MaRDI 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
cutting planesconvex mixed integer nonlinear programmingextended cutting plane algorithmextended supporting hyperplane algorithmsupporting hyperplane optimization toolkitsupporting hyperplanes
Related Items (30)
Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT ⋮ Reformulating the disjunctive cut generating linear program ⋮ A disjunctive cut strengthening technique for convex MINLP ⋮ On decomposition and multiobjective-based column and disjunctive cut generation for MINLP ⋮ Using projected cutting planes in the extended cutting plane method ⋮ The supporting hyperplane optimization toolkit for convex MINLP ⋮ On solving generalized convex MINLP problems using supporting hyperplane techniques ⋮ The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming ⋮ An overview of MINLP algorithms and their implementation in Muriqui optimizer ⋮ Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems ⋮ On the approximation of unbounded convex sets by polyhedra ⋮ Two linear approximation algorithms for convex mixed integer nonlinear programming ⋮ Fill‐rate service level constrained distribution network design ⋮ Polyhedral approximation of spectrahedral shadows via homogenization ⋮ 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 ⋮ On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm ⋮ Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization ⋮ Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts ⋮ Outer approximation for integer nonlinear programs via decision diagrams ⋮ A proximal-point outer approximation algorithm ⋮ Reformulations for utilizing separability when solving convex MINLP problems ⋮ Preprocessing and cutting planes with conflict graphs ⋮ Using regularization and second order information in outer approximation for convex MINLP ⋮ Branch-and-price for a class of nonconvex mixed-integer nonlinear programs ⋮ SHOT ⋮ Conflict Analysis for MINLP ⋮ 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
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
This page was built for publication: The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
