Sufficient conditions of optimality for multiobjective optimization problems with γ-paraconvex data
From MaRDI portal
Cited in
(11)- Optimality conditions for vector mathematical programming via a theorem of the alternative
- Subdifferentials of multifunctions and Lagrange multipliers for multiobjective optimization.
- Optimality conditions for proper efficient solutions of vector set-valued optimization.
- Necessary and sufficient conditions for set-valued maps with set optimization
- Uniform convexity, uniform monotonicity and \((\phi,c)\)-subdifferentiability with application to nonlinear PDE
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
- Optimality conditions for sharp minimality of order \(\gamma\) in set-valued optimization
- On Gâteaux differentiability of strongly cone paraconvex vector-valued mappings
- An extension of Brøndsted-Rockafellar's theorem with applications
- Generalized Moreau-Rockafellar type theorem for cone paraconvex multifunctions
- p-hyperconvexity with application to nonlinear PDE
This page was built for publication: Sufficient conditions of optimality for multiobjective optimization problems with γ-paraconvex data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4347685)