Semistrictly and neatly quasiconvex programming using lower global subdifferentials
Author(s): A. Kabgani & F. Lara
Year: 2023
Title: Semistrictly and neatly quasiconvex programming using lower global subdifferentials.
Journal: Journal of Global Optimization
pages: 845-865
Doi: https://doi.org/10.1007/s10898-023-01278-9
Cite this article
A. Kabgani \& F. Lara: Semistrictly and neatly quasiconvex programming using lower global subdifferentials. J Glob Optim (2023). https://doi.org/10.1007/s10898-023-01278-9
Abstract
The main goal of this paper is to investigate the properties and connections of neatly and semistrictly quasiconvex functions, especially when they appear in constrained and unconstrained optimization problems. The lower global subdifferential, recently introduced in the literature, plays an essential role in this study. We present several optimality conditions for constrained and unconstrained nonsmooth neatly/semistrictly quasiconvex optimization problems in terms of lower global subdifferentials. To this end, for a constrained optimization problem, we present some characterizations for the normal and tangent cones and the cone of feasible directions of the feasible set. Some relationships between the Greenberg–Pierskalla, tangentially and lower global subdifferentials of neatly and semistrictly quasiconvex functions are also given. The mentioned relationships show that the outcomes of this paper generalize some results existing in the literature.