Sufficiency Condition for KKT Points in Non-smooth Analysis

2014/02/03 by S. R. Pattanaik, Pattanaik, S R
Computer Science · Engineering · Mathematics · #Advanced Image Processing Techniques #Advanced Numerical Analysis Techniques #Applied mathematics #Economics #FOS: Mathematics #Iterative Methods for Nonlinear Equations #Karush–Kuhn–Tucker conditions #Mathematical optimization #Mathematics #Optimization and Control (math.OC)

paper · pdf · doi:10.48550/arxiv.1402.0293

openalex publication_date 2014/02/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Generalized Karush-Kuhn-Tucker Conditions for Real Continuous Optimization Problems
• On representations of the feasible set in convex optimization
• A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
• Necessary Optimality Conditions and Exact Penalization for Non-Lipschitz Nonlinear Programs
• Formalization of Optimality Conditions for Smooth Constrained Optimization Problems