Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
From MaRDI portal
Publication:2355322
The author proves that it is possible to unify the Karush-Kuhn-Tucker type optimality of \textit{J. B. Lasserre} [Optim. Lett. 4, No. 1, 1--5 (2010; Zbl 1180.90237)] and the nonsmooth result for locally Lipschitz functions given by \textit{J. Dutta} and \textit{C. S. Lalitha} [Optim. Lett. 7, No. 2, 221--229 (2013; Zbl 1267.90096)]. A KKT type theorem is derived in terms of the tangent subdifferential. It is shown that the convexity condition on the objective function can be relaxed to pseudoconvexity. This assumption is required only for the sufficiency of the KKT conditions. A new characterization of the convexity of the feasible set is given.
Recommendations
- On optimality conditions for pseudoconvex programming in terms of Dini subdifferentials
- Optimality conditions for convex problems on intersections of non necessarily convex sets
- scientific article; zbMATH DE number 20895
- scientific article; zbMATH DE number 4062008
- On the functions with pseudoconvex sublevel sets and optimality conditions
Cites work
- An introduction to the theory of nonsmooth optimization
- Convex Analysis
- On representations of the feasible set in convex optimization
- Optimality conditions in convex optimization revisited
- Optimality conditions under generalized convexity revisited
- Sufficient conditions for extremum, penalty functions and regularity
Cited in
(50)- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- Optimality conditions for nonconvex problems over nearly convex feasible sets
- Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization
- The DTC (difference of tangentially convex functions) programming: optimality conditions
- Convex optimization without convexity of constraints on non-necessarily convex sets and its applications in customer satisfaction in automotive industry
- Optimality conditions for convex problems on intersections of non necessarily convex sets
- Characterizing the solution set of convex optimization problems without convexity of constraints
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
- Error bounds for inequality systems defining convex sets
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- Optimality conditions in optimization problems with convex feasible set using convexificators
- On multiobjective bilevel optimization using tangential subdifferentials
- Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials
- A mean value theorem for tangentially convex functions
- scientific article; zbMATH DE number 1816760 (Why is no real title available?)
- scientific article; zbMATH DE number 4006010 (Why is no real title available?)
- \(\epsilon\)-Efficient solutions in semi-infinite multiobjective optimization
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- Nonsmooth constraint qualifications for nonconvex inequality systems
- Lagrange multiplier characterizations of constrained best approximation with nonsmooth nonconvex constraints
- Constraint qualifications for uncertain convex optimization without convexity of constraint data uncertainty
- KKT optimality conditions in non-smooth, non-convex optimization
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials
- Optimality Conditions for Nonconvex Constrained Optimization Problems
- On optimality conditions for pseudoconvex programming in terms of Dini subdifferentials
- Characterization of the extrema of a pseudoconvex function in terms of limiting and strong limiting subdifferential
- Characterizations of the solution set for tangentially convex optimization problems
- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
- Optimality conditions for MPECs in terms of directional upper convexifactors
- Duality and saddle point theorems of approximate solutions for nonsmooth semi-infinite multiobjective optimization problems
- Robust optimality conditions for semi-infinite equilibrium problems involving data uncertainty
- Applying tangential subdifferentials in bilevel optimization
- Fractional semi-infinite programming problems: optimality conditions and duality via tangential subdifferentials
- Necessary optimality conditions for nonsmooth multiobjective bilevel programs using the Drummond-Svaiter functional
- Optimality conditions for nondifferentiable interval-valued bilevel optimization problems via tangential subdifferentials
- Necessary and sufficient optimality conditions for nonsmooth nonconvex generalized Nash equilibrium problems
- Semi-infinite vanishing constraints problem with convexificators and optimality analysis
- Local optimality conditions and local saddle point theorems for nonconvex robust programming
- On multiobjective semi-infinite programs with vanishing constraints and tangential subdifferentials
- Sufficiency and duality criteria in tangential subdifferential governed bilevel multi-objective extremization models
- Characterizations of solution sets of nonsmooth mathematical programming problems
- Optimality conditions and duality for multiobjective fractional bilevel optimization problems
- Block coordinate descent methods of centres for solving block-constrained optimization problems
- Optimality conditions for nonsmooth vector interval-valued bilevel optimization problems in terms of tangential subdifferentials
- Tangential subdifferential-based necessary conditions for multiobjective min-max optimization
- Robustness in nonsmooth nonconvex optimization problems
- On representations of the feasible set in convex optimization
- On the functions with pseudoconvex sublevel sets and optimality conditions
This page was built for publication: Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355322)
