Journal
JOURNAL OF GLOBAL OPTIMIZATION
Volume 78, Issue 1, Pages 161-179Publisher
SPRINGER
DOI: 10.1007/s10898-020-00906-y
Keywords
Convex MINLP; Cutting plane algorithms; Supporting hyperplane algorithm; Nonsmooth Optimization
Funding
- Projekt DEAL
Ask authors/readers for more resources
Recently, Kronqvist et al. (J Global Optim 64(2):249-272, 2016) rediscovered the supporting hyperplane algorithm of Veinott (Oper Res 15(1):147-152, 1967) and demonstrated its computational benefits for solving convex mixed integer nonlinear programs. In this paper we derive the algorithm from a geometric point of view. This enables us to show that the supporting hyperplane algorithm is equivalent to Kelley's cutting plane algorithm (J Soc Ind Appl Math 8(4):703-712, 1960) applied to a particular reformulation of the problem. As a result, we extend the applicability of the supporting hyperplane algorithm to convex problems represented by a class of general, not necessarily convex nor differentiable, functions.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available