Vector critical points and cone efficiency in nonsmooth vector optimization
DOI10.11650/tjm/200701zbMath1479.90185OpenAlexW3048719110MaRDI QIDQ2233604
Tadeusz Antczak, Marcin Studniarski
Publication date: 11 October 2021
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11650/tjm/200701
optimality conditionsvector critical point(weakly) efficiencynonsmooth cone-\(FJ\)-pseudo-invexitynonsmooth cone-\(KT\)-pseudo-invexitynonsmooth mutiobjective programming
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality and duality in vector optimization involving generalized type I functions over cones
- Multiobjective optimization problems with modified objective functions and cone constraints and applications
- Generalized convexity and vector optimization.
- On the optimality of some classes of invex problems
- Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under \((\varPhi, \rho)\)-invexity
- Equality relating Euclidean distance cone to positive semidefinite cone
- Equivalence and existence of weak Pareto optima for multiobjective optimization problems with cone constraints
- Optimality and duality for nonsmooth multiobjective programming problems with \(V\)-\(r\)-invexity
- Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
- Invex functions and generalized convexity in multiobjective programming
- A new approach to multiobjective programming with a modified objective function
- On the variational principle
- A characterization of pseudoinvexity in multiobjective programming
- Generalized nonsmooth invexity over cones in vector optimization
- V-invex functions and vector optimization.
- Optimization and nonsmooth analysis
- Nondifferentiable optimization by smooth approximations
- Nonsmooth multiobjective programming
- Generalized Gradients and Applications
- Nonsmooth Invexity in Multiobjective Programming
- Generalized invexity for nonsmooth vector-valued mappings
- Optimality and Duality for Invex Nonsmooth Multiobjective programming problems
- On locally Lipschitz vector-valued invex functions
- On optimality and duality for multiple-objective optimization under generalized type I univexity
- On duality theorems for nonsmooth Lipschitz optimization problems
- 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