Optimality conditions in optimization problems with convex feasible set using convexificators

Author(s):  A. Kabgani, M. Soleimani-damaneh, & M. Zamani

Year: 2017

Title: Optimality conditions in optimization problems with convex feasible set using convexificators

Journal: Mathematical Methods of Operations Research  

pages: 103-121

Doi: https://doi.org/10.1007/s00186-017-0584-2

 Download

Cite this article

Kabgani, A., Soleimani-damaneh, M. \& Zamani, M. Optimality conditions in optimization problems with convex feasible set using convexificators. Math Meth Oper Res 86, 103-121 (2017). https://doi.org/10.1007/s00186-017-0584-2

Abstract

In this paper, we consider a nonsmooth optimization problem with a convex feasible set described by constraint functions which are neither convex nor differentiable nor locally Lipschitz necessarily. Utilizing upper regular convexificators, we characterize the normal cone of the feasible set and derive KKT type necessary and sufficient optimality conditions. Under some assumptions, we show that the set of KKT multipliers is bounded. We also characterize the set of optimal solutions and introduce a linear approximation corresponding to the original problem which is useful in checking optimality. The obtained outcomes extend various results existing in the literature to a more general setting.