On solving generalized convex MINLP problems using supporting hyperplane techniques

Abstract

<p>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 <em>generalized convex</em>, 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 ∘ 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 ∘ f∘

-pseudoconvex function, subject to f ∘ f∘

-pseudoconvex constraints. With some additional conditions, the proof is also valid for f ∘ 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, <a title="View reference" href="https://link.springer.com/article/10.1007/s10898-018-0644-z#CR12"><u>2017</u></a>) to also solve problems with f ∘ f∘

-pseudoconvex objective function.<br /></p>