Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints (Q778155)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
    scientific article

      Statements

      Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints (English)
      0 references
      0 references
      0 references
      0 references
      1 July 2020
      0 references
      In the paper under review, the authors study the following constrained vector optimization problem: \begin{align*} & \mathrm{Min}_{\mathbb{R}^m_+} f (x) := (f_1(x), \ldots, f_m(x)),\\ & \text{such that } x \in \{x \in \Omega \ | \ g_t(x) \le 0, t \in T\}, \end{align*} where \(f_i, i = 1, \ldots, m,\) and \(g_t , t \in T,\) are local Lipschitz functions from a Banach space \(X\) to \(\mathbb{R},\) \(\Omega\) is a nonempty and closed subset of \(X,\) and \(T\) is an arbitrary (possibly infinite) index set. Under certain assumptions, the authors provide necessary optimality conditions and sufficient optimality conditions in terms of Clarke subdifferentials for approximate (quasi) Pareto solutions of the problem. As an application, they obtain necessary optimality conditions for cone-constrained convex vector optimization problems and semidefinite vector optimization problems.
      0 references
      approximate Pareto solutions
      0 references
      optimality conditions
      0 references
      Clarke subdifferential
      0 references
      semi-infinite vector optimization
      0 references
      infinite vector optimization
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references