On solving generalized convex MINLP problems using supporting hyperplane techniques

Tapio Westerlund (), Ville-Pekka Eronen () and Marko M. Mäkelä
Additional contact information
Tapio Westerlund: Åbo Akademi University
Ville-Pekka Eronen: University of Turku
Marko M. Mäkelä: University of Turku

Journal of Global Optimization, 2018, vol. 71, issue 4, No 14, 987-1011

Abstract: Abstract Solution methods for convex mixed integer nonlinear programming (MINLP) problems have, usually, proven convergence properties if the functions involved are differentiable and convex. For other classes of convex MINLP problems fewer results have been given. Classical differential calculus can, though, be generalized to more general classes of functions than differentiable, via subdifferentials and subgradients. In addition, more general than convex functions can be included in a convex problem if the functions involved are defined from convex level sets, instead of being defined as convex functions only. The notion generalized convex, used in the heading of this paper, refers to such additional properties. The generalization for the differentiability is made by using subgradients of Clarke’s subdifferential. Thus, all the functions in the problem are assumed to be locally Lipschitz continuous. The generalization of the functions is done by considering quasiconvex functions. Thus, instead of differentiable convex functions, nondifferentiable $$f^{\circ }$$ f ∘ -quasiconvex functions can be included in the actual problem formulation and a supporting hyperplane approach is given for the solution of the considered MINLP problem. Convergence to a global minimum is proved for the algorithm, when minimizing an $$f^{\circ }$$ f ∘ -pseudoconvex function, subject to $$f^{\circ }$$ f ∘ -pseudoconvex constraints. With some additional conditions, the proof is also valid for $$f^{\circ }$$ f ∘ -quasiconvex functions, which sums up the properties of the method, treated in the paper. The main contribution in this paper is the generalization of the Extended Supporting Hyperplane method in Eronen et al. (J Glob Optim 69(2):443–459, 2017) to also solve problems with $$f^{\circ }$$ f ∘ -pseudoconvex objective function.

Keywords: Nonsmooth optimization; Mixed-integer nonlinear programming; Generalized convexities; Supporting hyperplanes; Cutting planes; 90C11; 90C25 (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10898-018-0644-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:71:y:2018:i:4:d:10.1007_s10898-018-0644-z

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-018-0644-z

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().