Abstract
This paper deals with a convex vector optimization problem with set-valued maps. In the absence of constraint qualifications, it provides, by the scalarization theorem, sequential Lagrange multiplier conditions characterizing approximate weak Pareto optimal solutions for the problem in terms of the approximate subdifferentials of the marginal function associated with corresponding set-valued maps. The paper shows also that this result yields the approximate Lagrange multiplier condition for the problem under a new constraint qualification which is weaker than the Slater-type constraint qualification. Illustrative examples are also provided to discuss the significance of the sequential conditions.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Vector optimization problems involving set-valued maps have received increasing attention in the optimization community as the value of a given function can be made to vary in a specified set because of forecasting errors or lack of complete information. Over the years, there has been a growing interest in establishing Lagrangian-type optimality conditions for several kinds of solutions of vector optimization problems with set-valued maps in a general setting by many scholars; see, e.g., [4, 12, 14, 15, 17, 18, 21, 42] and the references therein.
On the other hand, vector optimization problems with set-valued maps do not necessarily have the exact solutions, in which the global optimality is guaranteed. Moreover, a lot of solution methods produce approximations to the theoretical solutions. Therefore, from both the theoretical and the practical points of view, it is meaningful to consider various concepts of approximate solutions instead to optimization problems. Rong and Wu [36] initially introduced an approximate weak Pareto optimal solution of vector optimization problems with set-valued maps. Since the appearance of that paper, Lagrangian-type conditions for several notions of approximate solutions of vector optimizations with set-valued maps have been given in the literature; see, e.g., [9, 28,29,30, 38, 40, 43] and the references therein.
It is worth noting that in order to investigate optimality conditions for vector optimization problems with set-valued maps we often formulate a corresponding scalar optimization problem with set-valued maps. As a consequence, by employing the marginal function, one can characterize inevitable solutions of the scalar optimization problem with set-valued maps as a solution of a scalar optimization problem with single-valued maps. Nevertheless, by following this approach, the scalar optimization problem may not satisfy any constraint qualifications. Besides, most iterative algorithms or heuristic algorithms do not try out constraint qualifications at all, even though (approximate)-type Lagrangian conditions are always evaluated. This manner of facts leads one to modify Lagrange multiplier conditions without constraint qualifications; see, e.g., [6, 24, 25, 39] and the references therein. Recently, sequential optimality conditions not only have been admitted to be valuable in designing algorithms for finding approximate optimal solutions of nonlinear programming problems [1, 2, 32] but also have been used as a termination condition to optimization algorithms [10, 16, 41] and the references therein. Some modified Lagrangian optimality conditions have also been shown to establish sequential Lagrange multipliers for a weak Pareto optimal solution as well as a proper Pareto optimal solution of convex vector optimization problems with set-valued maps as indicated in [15]. It is noteworthy, however, that the convexity of a set-valued map considered in [15] is based on prescription by graph of the corresponding set-valued map so that this notion is stronger than the cone-convexity notions, see Remark 1.
Motivated and inspired by the works in the literature, the main purposes of this work is to establish sequential optimality conditions for approximate weak Pareto optimal solutions in convex vector optimization problem with set-valued maps that do not require any constraint qualifications by using the cone-convexity notions and the scalarization theorems. We employ the relation between the conjugate function of the scalar set-valued map and of the marginal function associated with corresponding the scalar set-valued map to examine an approximate optimal solution of the obtained scalarization problem. We then obtain a new sequential form of Lagrange multiplier condition for the approximate optimality in terms of the approximate subdifferentials. This is achieved by employing the description of the epigraph of a conjugate function written in terms of the approximate subdifferential. Our result, in the case of exact solutions, differs from another sequential optimality result [15] established in the literature, where the scalarization function the so-called oriented distance functions and coderivatives are used. The significance of this result is that it yields the standard (approximate) Lagrange multiplier rule condition for the vector optimization problem with set-valued maps under a new constraint qualification which is guaranteed by the Slater-type constraint qualification. For other results concerning on coderivatives and suboptimality of convex problems as well as nonconvex problems, we refer the readers to [33] and the references therein. The interested reader is referred to [34] for more information on basic properties of the marginal function.
The layout of the paper is as follows. In Sect. 2, some basic definitions, notations and several auxiliary results that will be used later in the paper are presented. In Sect. 3, without any constraint qualifications, we obtain some sequential optimality conditions for both an approximate weak Pareto optimal solution and a weak Pareto optimal solution in a convex vector optimization problem with set-valued maps in terms of the subdifferentials of the marginal function associated with scalar set-valued maps. Section 4 describes a new constraint qualification which guarantees that the approximate Lagrange multiplier condition holds for the approximate weak Pareto optimal solution. Section 5 summarizes the obtained results.
2 Preliminaries
In this section, we recall some notations, basic definitions, and preliminary results which will be used in succeeding sections. We denote by \({\mathbb R}^n\) the n-dimensional Euclidean space with the inner product \(\langle \cdot ,\cdot \rangle \) and the associated Euclidean norm \(\Vert \cdot \Vert \). The non-negative orthant of \({\mathbb R}^n\) is denoted by \({\mathbb R}^n_+\) and is defined by \({\mathbb R}^n_+:=\{(x_1,\ldots ,x_n)\in {\mathbb R}^n : x_i\geqq 0, \ i=1,\ldots ,n\}\). A nonempty subset S of \({\mathbb R}^n\) is said to be a cone if \(t S\subseteq S\) for all \(t\geqq 0\). The dual (positive polar) cone of S is denoted by \(S^+:=\{v\in {\mathbb R}^n : \langle v,x\rangle \geqq 0 \text { for all } x\in S\}\). For a nonempty set E in \({\mathbb R}^n\), by \(\mathrm{int}(E)\) (resp. \(\mathrm{ri}(E)\), \(\mathrm{cl}(E)\)) we will denote the interior (resp. relative interior (see, e.g., [35]), closure) of the set E. The support function\(\sigma _E\) is defined by \(\sigma _E(v):=\sup _{x\in E}\langle v,x \rangle \), and the indicator function \(\delta _E\) respect to a set E is defined as \(\delta _E(x):=0\) if \(x\in E\) and \(\delta _E(x):=+\,\infty \) else. We say that E is convex whenever \(t x_1 +(1-t)x_2\in E\) for all \(t\in [0,1]\), \(x_1, x_2\in E\).
For an extended real-valued function \(f:{\mathbb R}^n\rightarrow {\mathbb R}\cup \{\pm \,\infty \}\), the effective domain and the epigraph are respectively defined by \(\mathrm{dom}f:=\{x\in {\mathbb R}^n : f(x)<+\,\infty \}\) and \(\mathrm{epi}f:=\{(x,\alpha )\in {\mathbb R}^n \times {\mathbb R}: f(x)\leqq \alpha \}\). We say that f is proper if \(f(x)>-\,\infty \) for all \(x\in {\mathbb R}^n\) and \(\mathrm{dom}f\ne \emptyset \). A function f is said to be convex if \(f(t x_1+(1-t)x_2)\leqq t f(x_1)+(1-t)f(x_2)\) for all \(t\in [0,1]\) and \(x_1, x_2\in {\mathbb R}^n\) with the conventions: \((+\,\infty )+(-\,\infty )=(-\,\infty )+(+\,\infty )=0\cdot (+\,\infty )=+\,\infty \), \(0\cdot (-\,\infty )=0\). The conjugate function of f, \(f^*:{\mathbb R}^n\rightarrow {\mathbb R}\cup \{\pm \,\infty \}\), is defined by \( f^*(v)=\sup \{ \langle v,x\rangle -f(x): x\in {\mathbb R}^n\} \text { for any } v\in {\mathbb R}^n. \) Let \(\epsilon \geqq 0\) and \(\bar{x}\in {\mathbb R}^n\) be such that \(f(\bar{x})\in {\mathbb R}\). The \(\epsilon \)-subdifferential of f at \(\bar{x}\) [7] is the set \(\partial _\epsilon f(\bar{x}):=\{v\in {\mathbb R}^n : f(x)\geqq f(\bar{x})+\langle v,x-\bar{x}\rangle -\epsilon , \ \forall x\in {\mathbb R}^n\}.\) The \(\epsilon \)-normal set of E at \(\bar{x}\in E\) is given by \(N^\epsilon _E(\bar{x}):=\partial _\epsilon \delta _E\). When \(\epsilon =0\), we denote the subdifferential of f at \(\bar{x}\) and the normal cone of E at \(\bar{x}\in E\), respectively, by \(\partial f(\bar{x})\) and \(N_E(\bar{x})\). For a proper lower semicontinuous convex function \(f:{\mathbb R}^n\rightarrow {\mathbb R}\cup \{\pm \,\infty \}\) and \(\bar{x}\in \text {dom }f\), the epigraph of \(f^*\) can be represented as follows (see, e.g., [22]):
The following lemma is needed for our study.
Lemma 1
[5, 11] Let \(f_1,f_2:{\mathbb R}^n\rightarrow {\mathbb R}\cup \{\pm \,\infty \}\) be proper convex functions such that \(\mathrm{dom}f_1\cap \mathrm{dom}f_2\ne \emptyset \).
- (i)
If \(f_1\) and \(f_2\) are lower semicontinuous, then,
$$\begin{aligned} \mathrm{epi}(f_1+f_2)^*=\mathrm{cl}(\mathrm{epi}f^*_1+\mathrm{epi}f^*_2). \end{aligned}$$ - (ii)
If one of \(f_1\) and \(f_2\) is continuous at some \(\bar{x}\in \mathrm{dom}f_1\cap \mathrm{dom}f_2\), then,
$$\begin{aligned} \mathrm{epi}(f_1+f_2)^*=\mathrm{epi}f^*_1+\mathrm{epi}f^*_2. \end{aligned}$$
Let \(K\subseteq {\mathbb R}^p\) be a nonempty convex cone. For a set-valued map \(F:{\mathbb R}^n\rightrightarrows {\mathbb R}^p\), the domain and graph of F are, respectively, defined by \(\mathrm{dom}(F):=\{x\in {\mathbb R}^n : F(x)\ne \emptyset \}\), \(\mathrm{gph}(F):=\{(x,y)\in {\mathbb R}^n \times {\mathbb R}^m : x\in \mathrm{dom}(F), \ y\in F(x)\}\). F is called proper if \(\mathrm{dom}(F)\ne \emptyset \). For a nonempty set E in \({\mathbb R}^n\), the indicator function \(\widetilde{\delta }_E\) of E in the set-valued version is defined as \(\widetilde{\delta }_E(x):=\{0\}\) if \(x\in E\) and \(\widetilde{\delta }_E(x):=\emptyset \) else. Let \(C\subseteq {\mathbb R}^n\) be a nonempty convex set. We say that F is K-convex on C whenever \( t F(x_1)+(1-t)F(x_2)\subseteq F(t x_1+(1-t)x_2)+K \) for any \(t\in [0,1]\) and \(x_1, x_2\in {\mathbb R}^n\) with the conventions: \(E+\emptyset =\emptyset \) for any subset E in \({\mathbb R}^p\), and \(t\cdot \emptyset =\emptyset \) for any real numbers t. We also say that F is K-convex if \(\mathrm{dom}(F)\) is a convex set and F is K-convex on \(\mathrm{dom}(F)\). It should be noted that if F is K-convex, then \(F(x)+K\) is convex for any \(x\in {\mathbb R}^n\). In addition, for any proper set-valued map \(F:{\mathbb R}^n\rightrightarrows {\mathbb R}^p\) we can associate F with a linear scalarization set-valued map with respect to some \(\lambda \in K^+\) defined by \((\lambda \circ F)(x):=\{\langle \lambda ,y \rangle : y\in F(x)\}\) if \(x\in \mathrm{dom}(F)\) and \((\lambda \circ F)(x):=\emptyset \) else. Clearly, \(\mathrm{dom}(F)=\mathrm{dom}(\lambda \circ F)\) for every \(\lambda \in K^+\).
Remark 1
Let us now recall that a proper set-valued map \(F:{\mathbb R}^n\rightrightarrows {\mathbb R}^p\) is convex if \(\mathrm{gph}(F)\) is convex. Due to the following characterization: F is K-convex if and only if \(\mathrm{gph}(F)+(\{0\}\times K)\) is convex, see, e.g., [27, Proposition 3.3], we can verify that if F is convex then it is K-convex. In general, K-convexity of F needs not imply convexity of F. For a simple example, it can be observed that a proper set-valued map \(F:{\mathbb R}\rightrightarrows {\mathbb R}\), defined by \(F(x):=\{y\in {\mathbb R}: x^3\leqq y\leqq x^2\}\) if \(x\in [0,1]\) and \(F(x):=\emptyset \) else, is not convex but it is \({\mathbb R}_+\)-convex.
Unless otherwise stated, let A be a nonempty closed convex set in \({\mathbb R}^n\), \(F:{\mathbb R}^n\rightrightarrows {\mathbb R}^p\) be a proper set-valued mapping and \(K\subseteq {\mathbb R}^p\) be a nonempty pointed \((K\cap (-K)=\{0\})\) closed convex cone with nonempty interior. In this paper, we consider the following vector optimization problem with set-valued map:
Let \(\theta \in K\) be given. A point \((\bar{x},\bar{y})\in \mathrm{gph}(F)\) with \(\bar{x}\in A\) is said to be an \(\theta \)-weak Pareto optimal solution with respect to K of the problem (P) if
where \(\varOmega :=A\cap \mathrm{dom}(F)\) and \(F(\varOmega ):=\bigcup _{x\in \varOmega }F(x)\). When \(\theta :=0\), \(\theta \)-weak Pareto optimal solution deduces to be a weak Pareto optimal solution (if exists) of (P).
The next theorem yields a characterization of an \(\theta \)-weak Pareto optimal solution of (P) in terms of approximate solutions of the associated scalar set-valued optimization problem. In the following, let us recall the scalar set-valued optimization problem (SP):
where A is a nonempty closed convex set in \({\mathbb R}^n\) and \(H:{\mathbb R}^n\rightrightarrows {\mathbb R}\) is a proper set-valued map.
Given \(\epsilon \geqq 0\), let us recall also that a point \((\bar{x},\bar{y})\in \mathrm{gph}(H)\) with \(\bar{x}\in A\) is said to be an \(\epsilon \)-optimal solution of (SP) if for any \(x\in A\cap \mathrm{dom}(H)\) and any \(y\in H(x)\),
When \(\epsilon :=0\), \(\epsilon \)-optimal solution deduces to be an optimal solution of (SP).
Theorem 1
[36, Theorem 2.1](see also [38, Theorem 3.2]) Let \(\theta \in K\), F be a proper set-valued map from \({\mathbb R}^n\) into \({\mathbb R}^p\) and \((\bar{x},\bar{y})\in \mathrm{gph}(F)\) with \(\bar{x}\in A\). Assume that \(F(A\cap \mathrm{dom}(F))+\mathrm{int}K\) is convex. Then \((\bar{x},\bar{y})\) is an \(\theta \)-weak Pareto optimal solution of (P) if and only if there exists \(\lambda \in K^+\backslash \{0\}\) such that \((\bar{x},\langle \lambda ,\bar{y} \rangle )\) is an \(\langle \lambda ,\theta \rangle \)-optimal solution of the problem (SP) with \(H(\cdot ):=(\lambda \circ F)(\cdot )\).
Remark 2
If a proper set-valued map \(F:{\mathbb R}^n\rightrightarrows {\mathbb R}^p\) is K-convex, then F is K-convex on \(A\cap \mathrm{dom}(F)\), and so, \(F(A\cap \mathrm{dom}(F))+K\) is a convex set. Consequently, \(F(A\cap \mathrm{dom}(F))+\mathrm{int}K=(F(A\cap \mathrm{dom}(F))+K)+\mathrm{int}K\) is convex.
Interestingly, we point out that the scalar set-valued map can be employed by the marginal function, which is used to establish a characterization of weak Pareto optimal solutions in [18, Theorem 4.2]. In what follows, given a proper set-valued map \(H:{\mathbb R}^n\rightrightarrows {\mathbb R}\), by \(\varphi _H:{\mathbb R}^n\rightarrow {\mathbb R}\cup \{\pm \infty \}\) we denote the marginal function of H, i.e.,
It is clear that \(\mathrm{dom}(H)=\mathrm{dom}(\varphi _H)\). Recall that the conjugate function of the proper set valued map (see e.g., [28]) H, \(H^*:{\mathbb R}^n\rightarrow {\mathbb R}\cup \{\pm \infty \}\), defined by for any \(v\in {\mathbb R}^n\),
For a nonempty set E in \({\mathbb R}^n\), it could be convenient to observe that \((\widetilde{\delta }_{E})^*=\sigma _E=(\delta _E)^*\).
We close the section by the following results that justify why we are allowed to characterize an \(\theta \)-weak Pareto optimal solution of (P) by using conjugate function of the scalar set valued map.
Proposition 1
[28, Proposition 4.1] Let \(H_1,\ H_2:{\mathbb R}^n\rightrightarrows {\mathbb R}\) be proper set-valued maps such that \(\mathrm{dom}(H_1)\cap \mathrm{dom}(H_2)\ne \emptyset \). Suppose that for any \(x\in \mathrm{dom}(H_1)\cap \mathrm{dom}(H_2)\), \(\varphi _{H_1}(x)>-\infty \) and \(\varphi _{H_2}(x)>-\infty \). Then,
In particular, for any proper set-valued map \(H:{\mathbb R}^n\rightrightarrows {\mathbb R}\) such that \(\varphi _H(x)>-\infty \) for all \(x\in \mathrm{dom}(H)\), the identity \(H^*=(\varphi _{H})^*\) holds.
Lemma 2
Let \(\epsilon \geqq 0\) be given and \(H:{\mathbb R}^n\rightrightarrows {\mathbb R}\) be a proper set-valued map. If \(\mathrm{dom}(H)\cap A\ne \emptyset \), then the point \((\bar{x},\bar{y})\) with \(\bar{x}\in A\) is an \(\epsilon \)-optimal solution of (SP) if and only if \((0,-\bar{y}+\epsilon )\in \mathrm{epi}(H+\widetilde{\delta }_A)^*\).
Proof
A point \((\bar{x},\bar{y})\) with \(\bar{x}\in A\) is an \(\epsilon \)-optimal solution of (SP) if and only if for any \(x\in A\cap \mathrm{dom}( H)=\mathrm{dom}(H+\widetilde{\delta }_A)\) and any \(y\in H(x)=(H+\widetilde{\delta }_A)(x)\), \(-y\leqq -\bar{y}+\epsilon \), or equivalently, \((H+\widetilde{\delta }_A)^*(0)\leqq -\bar{y}+\epsilon \Leftrightarrow (0,-\bar{y}+\epsilon )\in \mathrm{epi}(H+\widetilde{\delta }_A)^*\). \(\square \)
Remark 3
It is worth noting that from Lemma 2 and Proposition 1 we can obtain a result in the line of [3, Lemma 3.1] by considering \( H(x):=\{f(x)\}\) if \(f(x)\in {\mathbb R}\) and \(H(x):=\emptyset \) else, where \(f:{\mathbb R}^n\rightarrow {\mathbb R}\cup \{+\infty \}\) is a proper lower semicontinuous function. In this case, for \(\bar{x}\in \mathrm{dom}f\cap A\), \(\bar{y}=f(\bar{x})\), \(\varphi _{H}=f\) and \(\varphi _{\widetilde{\delta }_A}=\delta _A\).
3 Sequential Lagrange multiplier conditions for \(\theta \)-weak Pareto solutions
In this section, we consider the vector optimization problem with set-valued map (P). Here, the feasible set A of the problem (P) is given by
where C is a nonempty closed convex subset of \({\mathbb R}^n\), S is a nonempty closed convex cone of \({\mathbb R}^m\) which does not necessarily have a nonempty interior, and \(G:{\mathbb R}^n\rightrightarrows {\mathbb R}^m\) is a proper set-valued map. The feasible set A has a quite general formulation, which provides a unified framework for examining various feasible sets for scalar/vector optimization problems. For example, if \(G(x):=\{g(x)\}\), where \(g:{\mathbb R}^n\rightarrow {\mathbb R}^m\) is a vector-valued function, the set A reduces to \(\{x\in C : g(x)\in -S\}\), which can be expressed of the form \(\{x\in C : \langle \mu ,g(x) \rangle \leqq 0, \ \forall \mu \in S^+\}\). Unfortunately, in the set-valued setting, the equality
may fail to be true in general. In fact, by taking \(G(x):=\{z:=(z_1,z_2)\in {\mathbb R}^n : \exp (z_1)-x\leqq z_2\}\) for all \(x\in {\mathbb R}\) and \(S:={\mathbb R}\times {\mathbb R}_+\). We see that \(\mathrm{dom}(G)={\mathbb R}\) and \(0\notin \widetilde{A}\). On the one hand, for each \(\mu :=(\mu _1,\mu _2)\in S^+=\{0\}\times {\mathbb R}_+\), we have
This shows that \(\varphi _{\mu \circ G}(0)=0\) for all \(\mu \in S^+\), and so, \(0\in \{x\in {\mathbb R}^n : \varphi _{\mu \circ G}(x)\leqq 0, \ \forall \mu \in S^+\}\).
Recently, an additional condition on the set-valued map G has been shown to guarantee the equality (2) (see, e.g., [37]). In what follows, one says that Assumption (A) holds if one of the following conditions holds:
- (A1):
For each \(x\in \mathrm{dom}(G)\), there exists \(z\in G(x)\) such that \(\varphi _{\mu \circ G}(x)=\langle \mu ,z\rangle \) for every \(\mu \in S^+\).
- (A2):
For each \(x\in \mathrm{dom}(G)\), G(x) is a compact subset of \({\mathbb R}^m\).
It is worth noting that there are no implication relations between (A1) and (A2), see, e.g., [37]. Note also that under the validity of assumption (A), the closedness of the set \(\widetilde{A}\) can be guaranteed by the lower semicontinuity of \(\varphi _{\mu \circ G}\) for all \(\mu \in S^+\). In the sequel, let us recall that G is S-proper (resp. nonnegatively S-lsc) if \(\varphi _{\mu \circ G}\) is proper (resp. lower semicontinuous) for all \(\mu \in S^+\). Hereafter, for the problem (P), we always assume in the rest of this paper that the proper set-valued mapping F is K-proper, K-convex and nonnegatively K-lsc, and the proper set-valued mapping G is S-proper, S-convex and nonnegatively S-lsc satisfying (A).
Remark 4
The following points are taken from [19, Remark 3.1], [26, Theorem 4.1] and [37], respectively. Let \(F:{\mathbb R}^n\rightrightarrows {\mathbb R}^p\) be a proper set-valued map. One has:
- (i)
\(\varphi _{\lambda \circ F}\) is convex for each \(\lambda \in K^+\) if and only if F is K-convex.
- (ii)
\(\varphi _{\lambda \circ F}\) is lower semicontinuous for each \(\lambda \in K^+\) provided that F is upper K-continuous on \(\mathrm{dom}(F)\) (see, e.g., [13, Definition 2.5.16] and [31, Definition 7.1]), i.e., for any \(x\in \mathrm{dom}(F)\) and any open set \(V\supseteq F(x)\), there exists a neighborhood U of x such that \(F(u)\subseteq V+K\) for all \(u\in U\).
- (iii)
\(\varphi _{\lambda \circ F}\) is proper for each \(\lambda \in K^+\) if either F has compact values on \(\mathrm{dom}(F)\) or F is K-bounded from below on\(\mathrm{dom}(F)\) in the sense that there exists \(a\in {\mathbb R}^p\) such that \(F(x)\subseteq a+K\) for all \(x\in \mathrm{dom}(F)\).
Next, we will obtain some sequential characterizations of \(\theta \)-weak Pareto optimal solution for the problem (P) in terms of the approximate subdifferentials of the marginal functions associated with F and G. We begin with the following two lemmas.
Lemma 3
[37, Proposition 2] Let a proper set-valued mapping \(G:{\mathbb R}^n\rightrightarrows {\mathbb R}^m\) be S-proper, S-convex and nonnegatively S-lsc satisfying (A). If \(\widetilde{A}:=\{x\in {\mathbb R}^n : G(x)\cap -S\ne \emptyset \}\ne \emptyset \), then
Remark 5
We point out that the set \(\cup _{\mu \in S^+}\mathrm{epi}(\varphi _{\mu \circ G})^*\) is a convex cone due to [37, Proposition 1]. Consequently, since \(\mathrm{epi}\delta ^*_C\) is a convex cone, the set \( \cup _{\mu \in S^+}\mathrm{epi}(\varphi _{\mu \circ G})^*+\mathrm{epi}\delta ^*_C \) is also a convex cone.
Lemma 4
If \(A\ne \emptyset \), then
Proof
Note by the definition of the indicator function in the set-valued version that \(\widetilde{\delta }_{A}=\widetilde{\delta }_{\widetilde{A}}+\widetilde{\delta }_C\). So, invoking Proposition 1, Lemmas 1(i) and , we have
and the proof is complete. \(\square \)
Theorem 2
For the problem (P), if \(\varOmega \ne \emptyset \), then \((\bar{x},\bar{y})\in \mathrm{gph}(F)\) with \(\bar{x}\in A\) is an \(\theta \)-weak Pareto optimal solution of (P) if and only if there exist \(\lambda \in K^+\backslash \{0\}\), \(\{\mu _l\}\subset S^+\), \(\{\epsilon _l\}, \ \{\eta _l\}, \ \{\zeta _l\}\subset {\mathbb R}_+\), \(u_l\in \partial _{\epsilon _l}\varphi _{\lambda \circ F}(\bar{x})\), \(v_l\in \partial _{\eta _l}\varphi _{\mu _l \circ G}(\bar{x})\), \(w_l\in N^{\zeta _l}_C(\bar{x})\) such that
and
Proof
Assume that a pair \((\bar{x},\bar{y})\in \mathrm{gph}(F)\) with \(\bar{x}\in A\) is an \(\theta \)-weak Pareto optimal solution of (P). On account of the K-convexity of F, by Remark 2, we apply Theorem 1 to assert that there exists \(\lambda \in K^+\backslash \{0\}\) such that \((\bar{x},\langle \lambda ,\bar{y}\rangle )\) is a \(\langle \lambda ,\theta \rangle \)-optimal solution of (SP) where \(H(x):=(\lambda \circ F)(x)\). So, Lemma 2 together with Proposition 1 yields
In addition, Lemma 4 gives us that
Taking (5) into account, we assert that there exist sequences \(\{\mu _l\}\subset S^+, \ \{(u_l,\alpha _l)\}\subset \mathrm{epi}(\varphi _{\lambda \circ F})^*, \ \{(v_l,\beta _l)\}\subset \mathrm{epi}(\varphi _{\mu _l \circ G})^* \text { and } \{(w_l,\gamma _l)\}\subset \mathrm{epi}\delta ^*_C \) such that \( u_l+v_l+w_l\rightarrow 0 \text { and } \alpha _l+\beta _l+\gamma _l\rightarrow -\langle \lambda , \bar{y} \rangle +\langle \lambda ,\theta \rangle \text { as } l\rightarrow +\infty . \) In view of (1), there exist sequences \(\{\epsilon _l\}, \ \{\eta _l\}, \ \{\zeta _l\}\subset {\mathbb R}_+\) such that
It follows that \(\alpha _l+\beta _l+\gamma _l=\langle u_l+v_l+w_l,\bar{x}\rangle -\varphi _{\lambda \circ F}(\bar{x})-\varphi _{\mu _l \circ G}(\bar{x})+(\epsilon _l+\eta _l+\zeta _l)\) for each \(l\in \mathbb {N}\). Now, passing to the limit as \(l\rightarrow +\infty \), we get
and so, (3) and (4) have been justified.
Conversely, suppose that there exist \(\lambda \in K^+\backslash \{0\}\), \(\{\epsilon _l\}, \ \{\eta _l\}, \ \{\zeta _l\}\subset {\mathbb R}_+\), \(u_l\in \partial _{\epsilon _l}\varphi _{\lambda \circ F}(\bar{x})\), \(v_l\in \partial _{\eta _l}\varphi _{\mu _l \circ G}(\bar{x})\), \(w_l\in N^{\zeta _l}_C(\bar{x})\) such that (3) and (4) hold. Let \(x\in A\cap \mathrm{dom}(F)\) and \(y\in F(x)\) be arbitrary. Then \(x\in C\) and there exists \(z\in G(x)\) such that \(z\in -S\). By taking into account the definitions of \(\varphi _{\lambda \circ F}\), \(\varphi _{\mu _l \circ G}\) and \(N^{\zeta _l}_C(\bar{x})\), we have, for each positive integer l,
Adding these inequalities, it holds that
Passing to the limit as \(l\rightarrow +\infty \), we obtain that \(\langle \lambda ,y\rangle \geqq \langle \lambda ,\bar{y}\rangle -\langle \lambda ,\theta \rangle \), showing that \((\bar{x},\langle \lambda ,\bar{y}\rangle )\) is a \(\langle \lambda ,\theta \rangle \)-optimal solution of (SP). Therefore, in view of Theorem 1, \((\bar{x},\bar{y})\) is an \(\theta \)-weak Pareto optimal solution of (P) as desired. \(\square \)
Next let us provide an example illustrating Theorem 2 where the Slater-type constraint qualification fails. Here, the set \(A:=\{x\in C : G(x)\cap -S\ne \emptyset \}\) is said to satisfy the Slater-type constraint qualification if \(\mathrm{int}S\ne \emptyset \) and there exists \(\hat{x}\in \mathrm{ri}C\) such that \(G(\hat{x})\cap -\mathrm{int}S\ne \emptyset \).
Example 1
Let \(K=S:={\mathbb R}^2_+\), \(C:=[-1,1]\), \(\theta :=(0.1,0.1)\), \((\bar{x},\bar{y}):=(0,(0.1,0.1))\) and let F and G be defined by \(F(x):=(x,-\frac{1}{2}\sqrt{x})+ {\mathbb R}^2_+\) if \(x\in [0,+\infty [\) and \(F(x):=\emptyset \) else, \(G(x):=\{(z_1,z_2)\in {\mathbb R}^2 : (z_1-x)^2+(z_2-1)^2\leqq 1\}\) for every \(x\in {\mathbb R}\). It can be easily checked that \(K^+=S^+={\mathbb R}^2_+\), \(A=[-1,0]\), \((\bar{x},\bar{y})\) is an \(\theta \)-weak Pareto optimal solution of (P) and that the Slater-type constraint qualification fails. Now, it can also be verified that for each \(\lambda :=(\lambda _1,\lambda _2)\in {\mathbb R}^2_+\), \(\varphi _{\lambda \circ F}(x)=\lambda _1 x-\frac{\lambda _2}{2}\sqrt{x}\) for all \(x\geqq 0\); otherwise \(\varphi _{\lambda \circ F}(x)=+\infty \), and for each \((\mu _1,\mu _2)\in {\mathbb R}^2_+\), \(\varphi _{\mu \circ G}(x)=\mu _1 x+\mu _2-\sqrt{\mu ^2_1+\mu ^2_2}\) for all \(x\in {\mathbb R}\). Putting \(\bar{\lambda }:=(0,1)\), \(\epsilon _l=\eta _l:=\frac{1}{\sqrt{l}}\), \(\zeta _l:=\frac{1}{2\sqrt{l}}\), \(\mu _l:=(\mu ^l_1,\mu ^l_2):=(\frac{\sqrt{l}}{2},\frac{\sqrt{l}}{4}(\frac{l^2-1}{l}))\) for each \(l\in \mathbb {N}\). Then, \(-\frac{\sqrt{l}}{2}\in \partial _{\epsilon _l}\varphi _{\bar{\lambda }\circ F}(\bar{x})\) and \(\frac{\sqrt{l}}{2}\in \partial _{\eta _l}\varphi _{\mu _l\circ G}(\bar{x})\). Indeed, a direct calculation shows that for any \(x\in {\mathbb R}^n\), \(-\frac{\sqrt{l}}{2}x\leqq \varphi _{\bar{\lambda }\circ F}(x)+\epsilon _l\), since
and \(\frac{\sqrt{l}}{2}x\leqq \frac{\sqrt{l}}{2}x+\eta _l=\varphi _{\mu _l\circ G}(x)-\varphi _{\mu _l\circ G}(\bar{x})+\eta _l\). In addition, it can be verified that
\(\langle \bar{\lambda },\theta \rangle -\langle \bar{\lambda },\bar{y} \rangle +\varphi _{\bar{\lambda }\circ F}(\bar{x})=0\), and \(N^{\zeta _l}_C(\bar{x})=[-\zeta _l,\zeta _l]\). Letting \(u_l:=-\frac{\sqrt{l}}{2}\), \(v_l:=\frac{\sqrt{l}}{2}\) and \(w_l:=\zeta _l\) for each \(l\in \mathbb {N}\), we see that \(u_l+v_l+w_l=\zeta _l\rightarrow 0\) and \(\epsilon _l+\eta _l+\zeta _l-\varphi _{\mu _l\circ G}(\bar{x})=\frac{3}{\sqrt{l}}\rightarrow 0\) as \(l\rightarrow +\infty \), showing that the sequential conditions of Theorem 2 hold. \(\square \)
The special case of \(\theta :=0\) in the preceding theorem gives us a new characterization of weak Pareto optimal solutions of (P) as follows.
Corollary 1
For the problem (P), if \(\varOmega \ne \emptyset \), then \((\bar{x},\bar{y})\in \mathrm{gph}(F)\) with \(\bar{x}\in A\) is a weak Pareto optimal solution of (P) if and only if there exist \(\lambda \in K^+\backslash \{0\}\), \(\{\mu _l\}\subset S^+\), \(\{\epsilon _l\}\subset {\mathbb R}_+\), \(u_l\in \partial _{\epsilon _l}\varphi _{\lambda \circ F}(\bar{x})\), \(v_l\in \partial _{\epsilon _l}\varphi _{\mu _l \circ G}(\bar{x})\), \(w_l\in N^{\epsilon _l}_C(\bar{x})\) such that \( \langle \lambda , \bar{y}\rangle =\varphi _{\lambda \circ F}(\bar{x})\),
Proof
By taking \(\theta :=0\) in Theorem 2, we know that \((\bar{x},\bar{y})\in \mathrm{gph}(F)\) with \(\bar{x}\in A\) is a weak Pareto optimal solution of (P) if and only if there exist \(\lambda \in K^+\backslash \{0\}\), \(\{\mu _l\}\subset S^+\), \(\{\widetilde{\epsilon }_l\}, \ \{\widetilde{\eta }_l\}, \ \{\widetilde{\zeta }_l\}\subset {\mathbb R}_+\), \(u_l\in \partial _{\widetilde{\epsilon }_l}\varphi _{\lambda \circ F}(\bar{x})\), \(v_l\in \partial _{\widetilde{\eta }_l}\varphi _{\mu _l \circ G}(\bar{x})\), \(w_l\in N^{\widetilde{\zeta }_l}_C(\bar{x})\) such that
and
Due to the feasibility of \(\bar{x}\), there exits \(\bar{z}\in G(\bar{x})\) such that \(\bar{z}\in -S\). It follows that for each \(l\in \mathbb {N}\), \(\varphi _{\mu _l \circ G}(\bar{x})\leqq \langle \mu _l,\bar{z} \rangle \leqq 0\). By \(\{\widetilde{\epsilon }_l\}, \ \{\widetilde{\eta }_l\}, \ \{\widetilde{\zeta }_l\}\subset {\mathbb R}_+\), \(-\varphi _{\mu _l \circ G}(\bar{x})\geqq 0\) and \(\langle \lambda ,\bar{y}\rangle -\varphi _{\lambda \circ F}(\bar{x})\geqq 0\), we can obtain that \(\langle \lambda , \bar{y}\rangle =\varphi _{\lambda \circ F}(\bar{x})\) and \(\lim _{l\rightarrow +\infty }\widetilde{\epsilon }_l=\lim _{l\rightarrow +\infty }\widetilde{\eta }_l=\lim _{l\rightarrow +\infty }\widetilde{\zeta }_l=\lim _{l\rightarrow +\infty }\varphi _{\mu _l \circ G}(\bar{x})=0\).
Letting \(\epsilon _l:=\max \{\widetilde{\epsilon }_l,\widetilde{\eta }_l,\widetilde{\zeta }_l\}\). Then, we have that \(\epsilon _l\rightarrow 0\) as \(l\rightarrow +\infty \) and \(u_l\in \partial _{\epsilon _l} \varphi _{\lambda \circ F}(\bar{x})\), \(v_l\in \partial _{\epsilon _l} \varphi _{\mu _l \circ G}(\bar{x})\), \(w_l\in N^{\epsilon _l}_C(\bar{x})\). So, we obtain the desired result. \(\square \)
4 A new constrained qualification for \(\theta \)-weak Pareto optimal solution
In this section, we give a new constrained qualification for \(\theta \)-weak Pareto optimal solution of problem (P). From now on, we say that the set \(A:=\{x\in C : G(x)\cap -S\ne \emptyset \}\) is said to satisfy the closed cone constraint qualification when the set
is closed.
Remark 6
In the case of G is a single-valued map, namely, \(G(x):=\{g(x)\}\) for every \(x\in {\mathbb R}^n\) where \(g:{\mathbb R}^n\rightarrow {\mathbb R}^m\), we get \(A=\{x\in C : g(x)\in -S\}\) and \(\varphi _{\mu \circ G}=\mu \circ g\) for each \(\mu \in S^+\). Then (CCCQ) collapses to the usual closed cone constraint qualification which was proposed in [23] and was used in [3, 11, 24, 25] and the references therein to establish optimality conditions for convex (infinite) programming problems.
The following theorem establishes necessary/sufficient optimality criteria for \(\theta \)-weak Pareto optimal solution of problem (P) in terms of approximate subdifferentials under the condition (CCCQ).
Theorem 3
For the problem (P), suppose that \(\mathrm{dom}(F)={\mathbb R}^n\). If \(A\ne \emptyset \) and (CCCQ) is fulfilled, then \((\bar{x},\bar{y})\in \mathrm{gph}(F)\) with \(\bar{x}\in A\) is an \(\theta \)-weak Pareto optimal solution of (P) if and only if there exist \(\lambda \in K^+\backslash \{0\}\), \(\mu \in S^+\), \(\epsilon ,\eta ,\zeta \in {\mathbb R}_+\) such that
and
Proof
As seen before, we know that \((\bar{x},\bar{y})\in \mathrm{gph}(F)\) with \(\bar{x}\in A\) is an \(\theta \)-weak Pareto optimal solution of (P) if and only if there exists \(\lambda \in K^+\backslash \{0\}\) such that (5) holds. Note that \(\varphi _{\lambda \circ F}\) is a convex function for each \(\lambda \in K^+\) due to K-convexity of F, and so, it is continuous on \(\mathrm{ri}(\mathrm{dom}(\varphi _{\lambda \circ F}))\). As \(\mathrm{dom}(\varphi _{\lambda \circ F})=\mathrm{dom}(\lambda \circ F)=\mathrm{dom}(F)={\mathbb R}^n\), \(\varphi _{\lambda \circ F}\) is a continuous function on \({\mathbb R}^n\). By Lemma 1(ii), one has
Since \(\cup _{\mu \in S^+}\mathrm{epi}(\varphi _{\mu \circ G})^*+\mathrm{epi}\delta ^*_C\) is closed, the above equality, by Lemma 4, becomes
This together with (5) in turn implies that there exist \(\mu \in S^+\), \((u,\alpha )\in \mathrm{epi}(\varphi _{\lambda \circ F})^*\), \((v,\beta )\in \mathrm{epi}(\varphi _{\mu \circ G})^*\) and \((w,\gamma )\in \mathrm{epi}\delta ^*_C\) such that \( 0=u+v+w \text { and } \alpha +\beta +\gamma =-\langle \lambda ,\bar{y}\rangle +\langle \lambda ,\theta \rangle . \) In view of (1), there exist \(\epsilon ,\eta ,\zeta \in {\mathbb R}_+\) such that
Therefore,
The converse conclusion can also be obtained easily by Theorem 2 and will be omitted. \(\square \)
The next example demonstrates that the approximate subgradient conditions (6) and/or (7) in Theorem 3 may fail for an \(\theta \)-weak Pareto optimal solution of (P) under the violation of the condition (CCCQ).
Example 2
Let K, S, C, and G be defined as in Example 1. Let \((\bar{x},\bar{y}):=(0,(1,0.1))\), \(\theta :=(0,0.1)\), and let F be defined by \(F(x):=(x,-x)+{\mathbb R}^2_+\) for every \(x\in {\mathbb R}\). Then we have already seen that \(K^+=S^+={\mathbb R}^2_+\), and for each \((\mu _1,\mu _2)\in {\mathbb R}^2_+\), \(\varphi _{\mu \circ G}(x)=\mu _1 x+\mu _2-\sqrt{\mu ^2_1+\mu ^2_2}\) for all \(x\in {\mathbb R}\). It can be easily checked that \((\bar{x},\bar{y})\) is an \(\theta \)-weak Pareto optimal solution of (P) and that for each \(\lambda :=(\lambda _1,\lambda _2)\in {\mathbb R}^2_+\), \(\varphi _{\lambda \circ F}(x)=(\lambda _1-\lambda _2)x\) for all \(x\in {\mathbb R}\). We assert that the conditions (6) and (7) in Theorem 3 do not hold for this setting. Otherwise, there exist \(\lambda :=(\lambda _1,\lambda _2)\in K^+\backslash \{0\}\), \(\mu :=(\mu _1,\mu _2)\in S^+\), \(\epsilon \), \(\eta \), \(\zeta \in {\mathbb R}_+\) such that
and
We obtain that \(\epsilon =\eta =\zeta =\lambda _1=-\mu _2+\sqrt{\mu ^2_1+\mu ^2_2}=0\) due to \(\epsilon , \ \eta , \ \zeta , \ \lambda _1, \ -\mu _2+\sqrt{\mu ^2_1+\mu ^2_2}\geqq 0\). It follows that \(\mu _1=0\), which result in \(\lambda _2=0\), and therefore, we arrive at a contradiction that \(\lambda \ne 0\). Consequently, the conclusion of Theorem 3 fails to hold. The reason is that the cone \(\cup _{\mu \in S^+}\mathrm{epi}(\varphi _{\mu \circ G})^*+\mathrm{epi}\delta ^*_C\) is not closed. To see this, for each \(\mu \in S^+\),
and \(\delta ^*_C(\cdot )=|\cdot |\). So,
and hence,
which is not closed.
On the other hand, letting \(\bar{\lambda }:=(\bar{\lambda }_1,\bar{\lambda }_2):=(0,1)\), \(\epsilon _l=\eta _l=\zeta _l:=\frac{1}{2l}\), \(\mu _l:=(\mu ^l_1,\mu ^l_2):=(1-\frac{1}{2l},l-1)\), \(u_l:=-1\), \(v_l:=\mu ^l_1\), and \(w_l:=\zeta _l\) for each \(l\in \mathbb {N}\). Then, elementary calculations give us
\(\langle \bar{\lambda },\bar{y}\rangle -\varphi _{\bar{\lambda } \circ F}(\bar{x})-\langle \bar{\lambda },\theta \rangle =0\), \(u_l+v_l+w_l=0\) and \( \epsilon _l+\eta _l+\zeta _l-\varphi _{\mu _l\circ G}(\bar{x})=\frac{2}{l}\rightarrow 0 \) as \(l\rightarrow +\infty \). So, the sequential conditions of Theorem 2 hold. \(\square \)
In the following corollary we derive an optimality condition for a weak Pareto optimal solution of (P) under the condition (CCCQ).
Corollary 2
For the problem (P), suppose that \(\mathrm{dom}(F)={\mathbb R}^n\). If \(A\ne \emptyset \) and (CCCQ) is fulfilled, then \((\bar{x},\bar{y})\in \mathrm{gph}(F)\) with \(\bar{x}\in A\) is a weak Pareto optimal solution of (P) if and only if there exist \(\lambda \in K^+\backslash \{0\}\) and \(\mu \in S^+\) such that \(\langle \lambda , \bar{y}\rangle =\varphi _{\lambda \circ F}(\bar{x})\),
Proof
We apply Theorem 3 with \(\theta :=0\) to assert that \((\bar{x},\bar{y})\in \mathrm{gph}(F)\) with \(\bar{x}\in A\) is a weak Pareto optimal solution of (P) if and only if there exist \(\lambda \in K^+\backslash \{0\}\), \(\mu \in S^+\), \(\epsilon ,\eta ,\zeta \in {\mathbb R}_+\) such that
and
Due to the feasibility of \(\bar{x}\), there exists \(\bar{z}\in G(\bar{x})\) such that \(\bar{z}\in -S\). This leads us to \(\varphi _{\mu \circ G}(\bar{x})\leqq \langle \mu ,\bar{z}\rangle \leqq 0\). By \(\epsilon , \ \eta , \ \zeta \in {\mathbb R}_+\), \(-\varphi _{\mu \circ G}(\bar{x})\geqq 0\) and \(\langle \lambda ,\bar{y}\rangle -\varphi _{\lambda \circ F}(\bar{x})\geqq 0\), it entails especially by (8) that
The rest of the proof for the converse conclusion follows by using Theorem 3 and so is omitted here. \(\square \)
Remark 7
In view of [28, Proposition 2.2.(ii)], we can also formulate a version of Theorem 2 and Corollary 1 (resp. Theorem 3 and Corollary 2) in terms of the radial \(\epsilon \)-subdifferentials (see e.g. [28, Definition 1.2]) (resp. radial subdifferentials) by assuming that \(\bar{x}\in \mathrm{int}(\mathrm{dom}(F))\).
Remark 8
It is interesting to note here that we can obtain in a similar manner the sequential characterizations of an approximate Pareto optimal solution as well as an approximate Benson proper Pareto optimal solution of (P) by using the scalarization theorems that given in [40, Theorem 4.1 and Theorem 4.4].
Next, under an additional condition, we will see that the Slater-type constraint qualification guarantees the validity of (CCCQ). To this aim, we need the following lemma.
Lemma 5
Suppose that \(\mathrm{int}(S)\ne \emptyset \) and there exists \(\hat{x}\in {\mathbb R}^n\) such that \(G(\hat{x})\cap -\mathrm{int}(S)\ne \emptyset \). Then the set \(\cup _{\mu \in S^+}\mathrm{epi}(\varphi _{\mu \circ G})^*\) is closed.
Proof
Let \( (v_l,\alpha _l)\in \cup _{\mu \in S^+}\mathrm{epi}(\varphi _{\mu \circ G})^* \) be such that \((v_l,\alpha _l) \rightarrow (v,\alpha )\) as \(l\rightarrow +\infty \). We only need to show that
To see this, as \(\mathrm{int}(S)\ne \emptyset \), there is a compact convex set \(\mathcal {B}\subseteq S^+\) with \(0\notin \mathcal {B}\) and \(S^+=\mathrm{cone}(\mathcal {B})\) (see, e.g., [20, Lemma 1.28(a)]). Then, there exist \(\{\mu _l\}\subset S^+\), \(\{t_l\}\subset {\mathbb R}_+\) and \(\{b_l\}\subset \mathcal {B}\) such that \(\mu _l=t_l b_l\), \((x_l,\alpha _l)\in \mathrm{epi}(\varphi _{\mu _l \circ G})^*= \mathrm{epi}(\mu _l \circ G)^*\) and \(b_l \rightarrow b\in \mathcal {B}\) as \(l\rightarrow +\infty \).
We first show that \(\{t_l\}\) is bounded. Otherwise, we may assume that \(t_l\rightarrow +\infty \) as \(l\rightarrow +\infty \). Then, for each \(l\in \mathbb {N}\),
In particular, due to \(\hat{x}\in {\mathbb R}^n\) satisfying \(G(\hat{x})\cap -\mathrm{int}(S)\ne \emptyset \), there is \(\hat{y}\in G(\hat{x})\) such that \(-\hat{y}\in \mathrm{int}(S)\). So, \( \langle v_l,\hat{x}\rangle -\langle \mu _l,\hat{y}\rangle \leqq \alpha _l, \) and consequently,
Passing to limit, we see that \(\langle b,\hat{y}\rangle \geqq 0\). On the one hand, as \(b\in S^+\backslash \{0\}\) and \(-\hat{y}\in \mathrm{int}(S)\), we have \(\langle b,\hat{y}\rangle <0\), a contradiction.
Now, since \(\{t_l\}\) is bounded, we may assume that \(t_l\rightarrow t\) as \(l\rightarrow +\infty \) for some \(t\in {\mathbb R}_+\). Thus, for each \(x\in \mathrm{dom}(G)\) and \(y\in G(x)\), one has \(\langle v,x\rangle -\langle tb,y\rangle \leqq \alpha \), and consequently, \((\bar{\mu }\circ G)^*(v)\leqq \alpha \) where \(\bar{\mu }:=tb\in S^+\). Therefore,
and the proof is complete. \(\square \)
Theorem 4
Suppose that \(\mathrm{int}(S)\ne \emptyset \) and there exists \(\hat{x}\in \mathrm{ri}(C)\) such that \(G(\hat{x})\cap -\mathrm{int}(S)\ne \emptyset \). If G is S-upper semicontinuous [13, Definition 2.5.21], i.e., \(\{x\in {\mathbb R}^n : G(x)\cap (y-\mathrm{int}(S))\ne \emptyset \}\) is open for every \(y\in {\mathbb R}^m\), then (CCCQ) holds.
Proof
As G is S-upper semicontinuous, the set \(\{x\in {\mathbb R}^n : G(x)\cap (-\mathrm{int}(S))\ne \emptyset \}\) is open, and so, \(\hat{x}\in \{x\in {\mathbb R}^n : G(x)\cap (-\mathrm{int}(S))\ne \emptyset \}\subseteq \mathrm{int}(\widetilde{A})\subseteq \mathrm{ri}(\widetilde{A})\). Since C and \(\widetilde{A}\) are closed convex sets, and \(\mathrm{ri}(C)\cap \mathrm{ri}(\widetilde{A})\ne \emptyset \), we have by [8, Proposition 3.2] that the set \(\mathrm{epi}\delta ^*_{\widetilde{A}}+\mathrm{epi}\delta ^*_C\) is closed. According to Lemma and 5, we obtain that \(\cup _{\mu \in S^+}\mathrm{epi}(\varphi _{\mu \circ G})^*+\mathrm{epi}\delta ^*_C\) is closed. \(\square \)
To this end, we give the following example that illustrates the case where (CCCQ) holds, whereas the Slater-type constraint qualification fails.
Example 3
Let \(C:=[-1,1]\), \(S:=\{(x_1,x_2)\in {\mathbb R}^2 : x_2\geqq 0\}\) and \(G(x):=\{(x,r)\in {\mathbb R}^2 : r\geqq \max \{x,0\}\}\) for every \(x\in {\mathbb R}\). Then, \(\mathrm{int}(S)\ne \emptyset \) and \(G(x)\cap -\mathrm{int}(S)=\emptyset \) for all \(x\in {\mathbb R}\). On the one hand, direct calculations show that \(\delta ^*_C(\cdot )=|\cdot |\), \(S^+=\{(\mu _1,\mu _2)\in {\mathbb R}^2 : \mu _1= 0, \ \mu _2\geqq 0\}\), and for each \(\mu \in S^+\), \(\varphi _{\mu \circ G}(x)=\mu _2\max \{x,0\}\),
Hence,
which is a closed set.
5 Conclusions
In this paper, we have employed the scalarization theorem and the relation between the conjugate function of the scalar set-valued map and of the marginal function associated with corresponding the scalar set-valued map to provide sequential Lagrange multiplier conditions characterizing approximate weak Pareto optimal solutions for the convex vector optimization problem with set-valued maps. These conditions are expressed in terms of the approximate subdifferentials of the related marginal functions. Moreover, the approximate Lagrange multiplier conditions for the problem have also been provided by using a new proposed constraint qualification, which is implied by the Slater-type condition.
References
Andreani, R., Martínez, J.M., Svaiter, B.F.: A new sequential optimality condition for constrained optimization and algorithmic consequences. SIAM J. Optim. 20, 3533–3554 (2010)
Andreani, R., Martínez, J.M., Ramos, A., Silva, P.J.S.: A cone-continuity constraint qualification and algorithmic consequences. SIAM J. Optim. 26, 96–110 (2016)
Bai, F., Wu, Z., Zhu, D.: Sequential Lagrange multiplier condition for \(\epsilon \)-optimal solution in convex programming. Optimization 57, 669–680 (2008)
Baier, J., Jahn, J.: On subdifferentials of set-valued maps. J. Optim. Theory Appl. 100, 233–240 (1999)
Boţ, R.I.: Conjugate Duality in Convex Optimization. Springer, Berlin (2010)
Boţ, R.I., Csetnek, E.R., Wanka, G.: Sequential optimality conditions in convex programming via perturbation approach. J. Convex Anal. 15, 149–164 (2008)
Brondsted, A., Rockafellar, R.T.: On the subdifferentiability of convex functions. Proc. Am. Math. Soc. 16, 605–611 (1965)
Burachik, R.S., Jeyakumar, V.: A simple closure condition for the normal cone intersection formula. Proc. Am. Math. Soc. 133, 1741–1748 (2005)
Durea, J., Dutta, J., Tammer, C.: Lagrange multipliers for \(\varepsilon \)-pareto solutions in vector optimization with nonsolid cones in Banach spaces. J. Optim. Theory Appl. 145, 196–211 (2010)
Dutta, J., Deb, K., Tulshyan, R., Arora, R.: Approximate KKT points and a proximity measure for termination. J. Glob. Optim. 56, 1463–1499 (2013)
Fang, D.H., Li, C., Ng, K.F.: Constraint qualifications for extended Farkas’s lemmas and Lagrangian dualities in convex infinite programming. SIAM J. Optim. 20, 1311–1332 (2009)
Flores-Bazán, F.: Optimality conditions in non-convex set-valued optimization. Math. Methods Oper. Res. 53, 403–417 (2001)
Göpfert, A., Riahi, H., Tammer, C., Zălinescu, C.: Variational Methods in Partially Ordered Spaces. Springer, New York (2003)
Götz, A., Jahn, J.: The Lagrange multiplier rule in set-valued optimization. SIAM J. Optim. 10, 331–344 (1999)
Ha, T.X.D.: Lagrange multipliers for set-valued optimization problems associated with coderivatives. J. Math. Anal. Appl. 311, 647–663 (2005)
Haeser, G., Melo, V.V.: Convergence detection for optimization algorithms: approximate-KKT stopping criterion when Lagrange multipliers are not available. Oper. Res. Lett. 43, 484–488 (2015)
Hernández, E., Jiménez, B., Novo, V.: Weak and proper efficiency in set-valued optimization on real linear spaces. J. Convex. Anal. 14, 275–296 (2007)
Hernández, E., Rodríguez-Marín, L., Sama, M.: Scalar multiplier rules in set-valued optimization. Comput. Math. Appl. 57, 1286–1293 (2000)
Huang, X.X., Yao, J.C.: Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems. J. Glob. Optim. 55, 611–626 (2013)
Jahn, J.: Vector Optimization: Theory, Applications, and Extensions. Springer, Heidelberg (2004)
Jahn, J., Rauh, R.: Contingent epiderivatives and set-valued optimization. Math. Methods Oper. Res. 46, 193–211 (1997)
Jeyakumar, V.: Asymptotic dual conditions characterizing optimality for convex programs. J. Optim. Theory Appl. 93, 153–165 (1997)
Jeyakumar, V., Dinh, N., Lee, G.M.: A new closed cone constraint qualification for convex Optimization. In: Applied Mathematics Research Report AMR04/8, School of Mathematics, University of New South Wales (2004)
Jeyakumar, V., Lee, G.M., Dinh, N.: New sequential Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs. SIAM J. Optim. 14, 534–547 (2003)
Jeyakumar, V., Wu, Z.Y., Lee, G.M., Dinh, N.: Liberating the subgradient optimality conditions from constraint qualifications. J. Glob. Optim. 36, 127–137 (2006)
Khoshkhabar-amiranloo, S., Khorram, E.: Scalar characterizations of cone-continuous setvalued maps. Appl. Anal. 95, 2750–2765 (2016)
Kuroiwa, D., Tanaka, T., Ha, T.X.D.: On cone convexity of set-valued maps. Nonlinear Anal. 30, 1487–1496 (1997)
Lee, G.M., Tuan, L.A.: On \(\epsilon \)-optimality conditions for convex set-valued optimization problems. Taiwan. J. Math. 13, 1787–1810 (2009)
Li, T.Y., Xu, Y.H., Zhu, C.X.: \(\epsilon \)-strictly efficient solutions of vector optimization problems with set-valued maps. Asia. Pac. J. Oper. Res. 24, 841–854 (2007)
Long, X.J., Li, X.B., Zeng, J.: Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems. Optim. Lett. 7, 1847–1856 (2013)
Luc, D.T.: Theory of Vector Optimization. Lecture Notes in Economics and Math Systems, vol. 319. Springer, Berlin (1989)
Martínez, J.M., Svaiter, B.F.: A practical optimality condition without constraint qualifications for nonlinear programming. J. Optim. Theory Appl. 118, 117–133 (2003)
Mordukhovich, B.S.: Variational Analysis and Applications. Springer, New York (2018)
Mordukhovich, B.S., Shao, Y.: Nonsmooth sequential analysis in Asplund spaces. Trans. Am. Math. Soc. 348, 1235–1280 (1996)
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1997)
Rong, W.D., Wu, Y.N.: \(\epsilon \)-weak minimal solutions of vector optimization problems with set-valued maps. J. Optim. Theory Appl. 106, 569–579 (2000)
Sisarat, N., Wangkeeree, R., Lee, G.M.: On set containment characterizations for sets described by set-valued maps with applications. J. Optim. Theory Appl. (2019). https://doi.org/10.1007/s10957-019-01605-9
Taa, A.: \(\varepsilon \)-subdifferentials of set-valued maps and \(\varepsilon \)-weak Pareto optimality for multiobjective optimization. Math. Methods Oper. Res. 62, 187–209 (2005)
Thibault, L.: Sequential convex subdifferential calculus and sequential Lagrange multipliers. SIAM J. Control Optim. 35, 1434–1444 (1997)
Tuan, L.A.: \(\epsilon \)-optimality conditions for vector optimization problems with set-valued maps. Numer. Func. Anal. Optim. 31, 78–95 (2010)
Tuyen, N.V., Yao, J.-C., Wen, C.-F.: A note on approximate Karush–Kuhn–Tucker conditions in locally Lipschitz multiobjective optimization. Optim. Lett. 13, 163–174 (2019)
Zheng, X.Y., Ng, K.F.: The Lagrange multiplier rule for multifunctions in Banach spaces. SIAM J. Optim. 17, 1154–1175 (2006)
Zhou, Z.A., Yang, X.M., Peng, J.W.: \(\epsilon \)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces. Optim. Lett. 8, 1047–1061 (2014)
Acknowledgements
We would like to express their sincere thanks to anonymous reviewers by their valuable corrections and comments, which greatly improved the readability of the paper. We also are grateful to Professor Gue Myung Lee for helpful discussions on the paper. The first-named author was supported by the Thailand Research Fund through the Royal Golden Jubilee Ph.D. Program (Grant No. PHD/0026/2555). The second-named author was supported by Naresuan University.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Sisarat, N., Wangkeeree, R. & Tanaka, T. Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps. J Glob Optim 77, 273–287 (2020). https://doi.org/10.1007/s10898-019-00864-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-019-00864-0
Keywords
- Convex vector optimization problems with set-valued maps
- Sequential Lagrange multiplier conditions
- Constraint qualifications
- Scalarizations
- Approximate weak Pareto optimal solutions