Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints (1808.10100v2)
Abstract: In this paper, we present some new necessary and sufficient optimality conditions in terms of the Clarke subdifferentials for approximate Pareto solutions of a nonsmooth vector optimization problem which has an infinite number of constraints. As a consequence, we obtain optimality conditions for the particular cases of cone-constrained convex vector optimization problems and semidefinite vector optimization problems. Examples are given to illustrate the obtained results.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.