Vector critical points and cone efficiency in nonsmooth vector optimization
DOI10.11650/TJM/200701zbMATH Open1479.90185OpenAlexW3048719110MaRDI QIDQ2233604FDOQ2233604
Authors: 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
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
optimality conditionsvector critical point(weakly) efficiencynonsmooth cone-\(FJ\)-pseudo-invexitynonsmooth cone-\(KT\)-pseudo-invexitynonsmooth mutiobjective programming
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nondifferentiable optimization by smooth approximations
- On the variational principle
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiobjective optimization problems with modified objective functions and cone constraints and applications
- Optimality and duality for nonsmooth multiobjective programming problems with \(V\)-\(r\)-invexity
- Invex functions and generalized convexity in multiobjective programming
- Title not available (Why is that?)
- Equality relating Euclidean distance cone to positive semidefinite cone
- Equivalence and existence of weak Pareto optima for multiobjective optimization problems with cone constraints
- V-invex functions and vector optimization.
- Generalized Gradients and Applications
- Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under \((\varPhi, \rho)\)-invexity
- Nonsmooth multiobjective programming
- Title not available (Why is that?)
- Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
- Generalized nonsmooth invexity over cones in vector optimization
- Title not available (Why is that?)
- On locally Lipschitz vector-valued invex functions
- Generalized convexity and vector optimization.
- On the optimality of some classes of invex problems
- Title not available (Why is that?)
- Optimality and Duality for Invex Nonsmooth Multiobjective programming problems
- On duality theorems for nonsmooth Lipschitz optimization problems
- A new approach to multiobjective programming with a modified objective function
- A characterization of pseudoinvexity in multiobjective programming
- Nonsmooth Invexity in Multiobjective Programming
- Generalized invexity for nonsmooth vector-valued mappings
- Optimality and duality in vector optimization involving generalized type I functions over cones
- On optimality and duality for multiple-objective optimization under generalized type I univexity
- Vector critical points and efficiency in vector optimization with Lipschitz functions
Cited In (4)
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)
