1. Optimality conditions for nonconvex problems over nearly convex feasible sets.
- Author
-
Ghafari, N. and Mohebi, H.
- Subjects
CONVEX sets ,CONVEX functions ,CONVEX programming ,POINT set theory ,NONCONVEX programming ,SUBDIFFERENTIALS - Abstract
In this paper, we study the optimization problem (P) of minimizing a convex function over a constraint set with nonconvex constraint functions. We do this by given new characterizations of Robinson's constraint qualification, which reduces to the combination of generalized Slater's condition and generalized sharpened nondegeneracy condition for nonconvex programming problems with nearly convex feasible sets at a reference point. Next, using a version of the strong CHIP, we present a constraint qualification which is necessary for optimality of the problem (P). Finally, using new characterizations of Robinson's constraint qualification, we give necessary and sufficient conditions for optimality of the problem (P). [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF