Optimality conditions for convex problems on intersections of non necessarily convex sets
The KKT theorem provides necessary and sufficient conditions for the global optimality of convex optimization problems under suitable regularity assumptions. In this paper, the authors consider optimization problems with sets rather than inequality constraints. They also assume that each individual set is not necessarily convex, but their intersection is. They prove a KKT-type theorem for such problems under a local convexity assumption on the defining sets. For the KKT condition's sufficiency, the objective function is assumed to be pseudoconvex in an appropriate sense. The proof of the main result relies on the use of an oriented distance instead of the classical distance, making the inequality constraints satisfy the Slater constraint qualification condition.
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- A necessary optimality condition for quasiconvex functions on closed convex sets
- On optimality conditions for pseudoconvex programming in terms of Dini subdifferentials
- scientific article; zbMATH DE number 3908178
- Optimality conditions for a nonconvex set-valued optimization problem
- An introduction to the theory of nonsmooth optimization
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Convex Analysis
- scientific article; zbMATH DE number 3737398 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 3336546 (Why is no real title available?)
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- On representations of the feasible set in convex optimization
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Optimality Conditions for Quasiconvex Programs
- Optimality conditions in convex optimization revisited
- Optimality conditions in optimization problems with convex feasible set using convexificators
- Revisiting Tietze-Nakajima: local and global convexity for maps
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Convex optimization without convexity of constraints on non-necessarily convex sets and its applications in customer satisfaction in automotive industry
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- A mean value theorem for tangentially convex functions
- Continuity and selections of the intersection operator applied to nonconvex sets
- scientific article; zbMATH DE number 4098152 (Why is no real title available?)
- Intersection properties for cones of nondecreasing concave functions
- Nonsmooth constraint qualifications for nonconvex inequality systems
- Nonseparation of Sets and Optimality Conditions
- Characterizations of the solution set for tangentially convex optimization problems
- Optimality and duality for robust optimization problems involving intersection of closed sets
- Normal cone and subdifferential with respect to a set at infinity and their applications
- The Gauss map of a nonsmooth convex cone and the antipodal mate property
- Optimality and duality for approximate solutions of multiobjective optimization problems involving intersection of closed sets
- Robust approximate optimality conditions for uncertain vector optimization problems and applications
This page was built for publication: Optimality conditions for convex problems on intersections of non necessarily convex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2173517)
