Optimality conditions for nonconvex problems over nearly convex feasible sets
| Autor: | H. Mohebi, N. Ghafari |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Mathematical optimization
021103 operations research Optimization problem General Mathematics 0211 other engineering and technologies Regular polygon 010103 numerical & computational mathematics 02 engineering and technology 01 natural sciences Set (abstract data type) Constraint (information theory) Constraint functions 0101 mathematics Convex function Mathematics |
| Zdroj: | Arabian Journal of Mathematics. 10:395-408 |
| ISSN: | 2193-5351 2193-5343 |
| DOI: | 10.1007/s40065-021-00315-3 |
| Popis: | 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). |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|