Generalized convexity in nondifferentiable programming
Bevil M. Glover · Bulletin of the Australian Mathematical Society · 1984
For an abstract mathematical programming problem involving quasidifferentiable cone-constraints we obtain necessary (and sufficient) optimality conditions of the Kuhn-Tucker type without recourse to a constraint qualification. This extends the known results to the non-differentiable setting. To obtain these results we derive several simple conditions connecting various concepts in generalized convexity not requiring differentiability of the functions involved.