Quasinormality and pseudonormality for nonlinear semidefinite programming
Quasinormality is a classical constraint qualification originally introduced by Hestenes in 1975 and subsequently extensively studied in nonlinear programming and in problems with abstract constraints. In this paper, we extend this concept to the setting of nonlinear semidefinite programming (NSDP). We show that the proposed condition is strictly weaker than Robinson’s constraint qualification, while still … Read more