Invex functions and constrained local minima
Invex functions and constrained local minima
If a certain weakening of convexity holds for the objective and all constraint functions in a nonconvex constrained minimization problem, Hanson showed that the Kuhn-Tucker necessary conditions are sufficient for a minimum. This property is now generalized to a property, called K -invex, of a vector function in relation to …