2000 character limit reached
Sufficiency Condition for KKT Points in Non-smooth Analysis
Published 3 Feb 2014 in math.OC | (1402.0293v5)
Abstract: In this article we consider a convex feasible set described by inequality constraints that are continuous and not necessarily Lipschitz or convex. We show that if the Slater constraint qualification and a non-degeneracy condition are satisfied, then the Karush-Kuhn-Tucker type optimality condition is both necessary and sufficient. In this way we extend previous results which are proved for Lipschitz and differentiable inequalities.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.