FIRST DRAFT

The phrase convex optimization refers to the minimization of a convex function over a convex set. However the feasible convex set need not be always described by convex inequalities. In this article we consider a convex feasible set which are described by inequality constraints which are locally Lipschitz and not necessarily convex and need not be smooth. We show that if the Slater’s constraint qualification and a simple non-degeneracy condition is satisfied then the Karush-Kuhn-Tucker type optimality condition is both necessary and sufficient.