Vector critical points and cone efficiency in nonsmooth vector optimization
From MaRDI portal
Publication:2233604
Vector critical points in the senses of Fritz John and Karush-Kuhn-Tucker as well as weakly \(K\)-efficient and \(K\)-efficient solutions to nonsmooth vector optimization problems with cone and equality constraints are studied in the situation when each component of the involved functions is locally Lipschitz continuous under cone-\(FJ\)-pseudo-invexity and cone-\(KT\)-pseudo-invexity hypotheses and via the Clarke generalized gradient for vector-valued functions, respectively.
Recommendations
- Vector critical points and efficiency in vector optimization with Lipschitz functions
- Vector critical points and generalized quasi-efficient solutions in nonsmooth multi-objective programming
- Efficient and weak efficient points in vector optimization with generalized cone convexity
- Optimality and duality in nonsmooth conic vector optimization
- Characterizations of efficient points in convex vector optimization problems
- scientific article; zbMATH DE number 1664585
- scientific article; zbMATH DE number 1159281
- Generalized convexity and nonsmooth problems of vector optimization
- Vector optimization w.r.t. relatively solid convex cones in real linear spaces
- Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization
Cites work
- A characterization of pseudoinvexity in multiobjective programming
- A new approach to multiobjective programming with a modified objective function
- Equality relating Euclidean distance cone to positive semidefinite cone
- Equivalence and existence of weak Pareto optima for multiobjective optimization problems with cone constraints
- Generalized convexity and vector optimization.
- Generalized Gradients and Applications
- Generalized invexity for nonsmooth vector-valued mappings
- Generalized nonsmooth invexity over cones in vector optimization
- scientific article; zbMATH DE number 3137662 (Why is no real title available?)
- scientific article; zbMATH DE number 36688 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 1328995 (Why is no real title available?)
- scientific article; zbMATH DE number 1834618 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3271001 (Why is no real title available?)
- scientific article; zbMATH DE number 3399886 (Why is no real title available?)
- Invex functions and generalized convexity in multiobjective programming
- Multiobjective optimization problems with modified objective functions and cone constraints and applications
- Nondifferentiable optimization by smooth approximations
- Nonsmooth Invexity in Multiobjective Programming
- Nonsmooth multiobjective programming
- On duality theorems for nonsmooth Lipschitz optimization problems
- On locally Lipschitz vector-valued invex functions
- On optimality and duality for multiple-objective optimization under generalized type I univexity
- On the optimality of some classes of invex problems
- On the variational principle
- Optimality and Duality for Invex Nonsmooth Multiobjective programming problems
- Optimality and duality for nonsmooth multiobjective programming problems with \(V\)-\(r\)-invexity
- Optimality and duality in vector optimization involving generalized type I functions over cones
- Optimization and nonsmooth analysis
- Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under (, )-invexity
- V-invex functions and vector optimization.
- Vector critical points and efficiency in vector optimization with Lipschitz functions
- Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
Cited in
(7)- Critical points index for vector functions and vector optimization
- Characterizations of efficient and weakly efficient points in nonconvex vector optimization
- Vector critical points and generalized quasi-efficient solutions in nonsmooth multi-objective programming
- Two approaches toward constrained vector optimization and identity of the solutions
- Characterizations of two classes of cone generalized pseudoinvexity
- scientific article; zbMATH DE number 3880459 (Why is no real title available?)
- Vector critical points and efficiency in vector optimization with Lipschitz functions
This page was built for publication: Vector critical points and cone efficiency in nonsmooth vector optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233604)
