Optimality Conditions Under a New Constraint Qualification for Nonconvex Optimization Problems
Preprint
- 26 November 2025
- preprint
- Published by MDPI AG in Preprints.org
Abstract
The aim of this paper is to give necessary and sufficient optimality conditions for nonconvex optimization problems such that the constraint inequalities are both nonnegative and nonpositive, where the objective function and the constraint functions are tangentially convex, but are not necessarily convex. We do this first by introducing a novel constraint qualification, call “tangential nearly convexity” ((TNC), in short). Next, by using the cone of tangential subdifferentials together with the novel constraint qualification, we show that Karush-Kuhn-Tucker (KKT) conditions are necessary and sufficient for the optimality. Several examples are presented to clarify and compare the novel constraint qualification with the other well known constraint qualifications.Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- A Mean Value Theorem for Tangentially Convex FunctionsSet-Valued and Variational Analysis, 2023
- Optimality conditions for convex problems on intersections of non necessarily convex setsJournal of Global Optimization, 2019
- Optimality conditions of the set-valued optimization problem with generalized cone convex set-valued maps characterized by contingent epiderivativeActa Mathematicae Applicatae Sinica, English Series, 2018
- Vector Variational Inequalities and Vector Optimization2018
- Karush–Kuhn–Tucker Conditions in Set OptimizationJournal of Optimization Theory and Applications, 2017
- Necessary and sufficient KKT optimality conditions in non-convex optimizationOptimization Letters, 2016
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraintsOptimization Letters, 2014
- Introduction to Nonsmooth Optimization2014
- Optimality conditions in convex optimization revisitedOptimization Letters, 2011
- On representations of the feasible set in convex optimizationOptimization Letters, 2009