Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/288454 
Year of Publication: 
2020
Citation: 
[Journal:] Journal of Global Optimization [ISSN:] 1573-2916 [Volume:] 78 [Issue:] 1 [Publisher:] Springer US [Place:] New York, NY [Year:] 2020 [Pages:] 161-179
Publisher: 
Springer US, New York, NY
Abstract: 
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.
Subjects: 
Convex MINLP
Cutting plane algorithms
Supporting hyperplane algorithm
Nonsmooth Optimization
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.