 Research
 Open access
 Published:
Equivalent properties of global weak sharp minima with applications
Journal of Inequalities and Applications volume 2011, Article number: 137 (2011)
Abstract
In this paper, we study the concept of weak sharp minima using two different approaches. One is transforming weak sharp minima to an optimization problem; another is using conjugate functions. This enable us to obtain some new characterizations for weak sharp minima.
Mathematics Subject Classification (2000): 90C30; 90C26.
1 Introduction
The notion of weak sharp minima plays an important role in the analysis of the perturbation behavior of certain classes of optimization problems as well as in the convergence analysis of algorithms. Of particular note in this fields is the paper by Burke and Ferris [1], which gave an extensive exposition of the notation and its impacted on convex programming and convergence analysis. Since then, this notion was extensively studied by many authors, for example, necessary or sufficient conditions of weak sharp minima for nonconvex programming [2, 3], and necessary and sufficient conditions of local weak sharp minima for suptype (or lowerC^{1}) functions [4, 5]. Recent development of weak sharp minima and its related to other issues can be found in [5–8].
A closed set \stackrel{\u0304}{S}\subseteq {\mathbb{R}}^{n} is said to be a set of weak sharp minima for a function f : ℝ^{n} → ℝ relative to a closed set S ⊆ ℝ^{n} with \stackrel{\u0304}{S}\subseteq S, if there is an α > 0 such that
where \mathsf{\text{dist}}\left(x,\stackrel{\u0304}{S}\right) denotes the Euclidean distance from x to \stackrel{\u0304}{S}, i.e.,
An ordinary way to deal with weak sharp minima is using the tools of variational analysis, such as subdifferentials and normal cones or various generalized derivatives and tangent cones. However, we study in this paper the concept of weak sharp minima from a new perspective. The nonconvex and convex cases are treated separately. Specifically, for the nonconvex case, we establish the close relationship between weak sharp minima and the generalized semiinfinite maxmin programming (see (2.2) below). To the best of our knowledge, these results do not appear explicitly in the literature. For the convex case, we use conjugate functions to characterize weak sharp minima. This gives a unified way to deal with different problems, such as convex inequality system and affine convex inclusion. Finally, applications of weak sharp minima to algorithm analysis for solving variational inequality problem are given.
We first recall some preliminary notions and results, which will be used throughout this paper. Given a set A ⊂ ℝ^{n}, we denote its closure and convex hull as clA and convA, respectively. Denote its polar cone as
The indicator function and support function of A are defined by
and
The conjugate function of a function f : ℝ^{n} → ℝ is
and the biconjugate function is defined as f**(x) = (f*)*(x), i.e., the conjugate of f*. The infconvolution operation between f_{1} and f_{2} is
The rest of the paper is organized as follows. The relationship between weak sharp minima and generalized semiinfinite programming is established in Section 2. In Section 3, we characterize the weak sharpness by using conjugate duality.
2 Nonconvex case
In this section, we show that the concept of weak sharp minima can be translated equivalently to a generalized semiinfinite maxmin programming. Given α > 0, define a setvalued mapping as
Clearly, this set is nonempty, since x ∈ S_{ α }(x) for all α > 0. Let \stackrel{\u0304}{f} stand for the optimal value of f over S. Some equivalent expressions of weak sharpness in terms of S_{ α } are given below.
Theorem 2.1. Let f be a lower semicontinuous function. The following statements are equivalent:
(a). \stackrel{\u0304}{S} is a set of weak sharp minima;
(b). There exists some α > 0 such that {S}_{\alpha}\left(x\right)\cap \stackrel{\u0304}{S}\ne \varnothing for all x ∈ S;
(c). There exists some α > 0 such that, for any x ∈ S, one has
Proof. (a) ⇒ (b). If \stackrel{\u0304}{S} is weak sharpness, it is easy to see that there exists α > 0 such that
If x\in \stackrel{\u0304}{S}, then x ∈ S_{ α }(x) for any α > 0 by definition. Thus, the conclusion is true. If x\in S\backslash \stackrel{\u0304}{S}, let \stackrel{\u0304}{x}\in {P}_{\stackrel{\u0304}{S}}\left(x\right), the projection of x onto \stackrel{\u0304}{S}. Then, the above inequality implies that
i.e, \stackrel{\u0304}{x}\in {S}_{\alpha}\left(x\right). Thus, {S}_{\alpha}\left(x\right)\cap \stackrel{\u0304}{S}\ne \varnothing.

(b)
⇒ (c). It is elementary.

(c)
⇒ (a). Choose x ∈ S. The definition of infimum guarantees the existence of a sequence {y_{ n }} ⊆ S_{ α }(x) such that f(y_{ n }) approaches to \stackrel{\u0304}{f}. Since y_{ n } ∈ S_{ α }(x), then
\stackrel{\u0304}{f}+\alpha \parallel x{y}_{n}\parallel \phantom{\rule{2.77695pt}{0ex}}\le f\left({y}_{n}\right)+\alpha \parallel x{y}_{n}\parallel \phantom{\rule{2.77695pt}{0ex}}\le f\left(x\right),(2.1)
where the first step comes from the fact that y_{ n } ∈ S and \stackrel{\u0304}{f} is the optimal value. Thus, \alpha \parallel x{y}_{n}\parallel \phantom{\rule{2.77695pt}{0ex}}\le f\left(x\right)\stackrel{\u0304}{f}, which means the boundness of {y_{ n }}. Passing to a subsequence if necessary, we can assume that {y_{ n }} converges to a limit point \u0233. We claim that \u0233\in {S}_{\alpha}\left(x\right), since S_{ α }(x) is closed, due to the lower semicontinuity of f. Using this property again, we have
On the other hand, since \stackrel{\u0304}{f} is the optimal value, then f\left(\u0233\right)\ge \stackrel{\u0304}{f}. Hence, f\left(\u0233\right)=\stackrel{\u0304}{f}, i.e., \u0233\in \stackrel{\u0304}{S}. Taking limits in (2.1) yields \stackrel{\u0304}{f}+\alpha \parallel x\u0233\parallel \phantom{\rule{2.77695pt}{0ex}}\le f\left(x\right). Therefore,
where the first step is due to the fact that \u0233\in \stackrel{\u0304}{S}. Since x is an arbitrary element in S, then the above inequality means that \stackrel{\u0304}{S} is weakly sharp. □
The foregoing theorem shows that the concept of weak sharp minima can be converted into a class of optimization problems with the same optimal value. Based on this fact, we further derive the following result.
Theorem 2.2. Let f be a lower semicontinuous function. Then, the following statements are equivalent:
(a). \stackrel{\u0304}{S} is a set of weak sharp minima;
(b). There exists α > 0 such that \stackrel{\u0304}{f} is the optimal value of the following generalized semiinfinite maxmin programming
Proof. It is easy to see that the following estimate
coincides with
since \stackrel{\u0304}{f} is the optimal value of f over S. Therefore, the desired result follows from Theorem 2.1. □
To the best of our knowledge, the connection between weak sharp minima and the generalized semiinfinite programming is not stated explicitly in the literature. This result makes it possible to characterize weak sharpness by using the theory of generalized semiinfinite programming [9–11] and vice verse. In addition, the condition imposed in the foregoing theorem only needs the function to be lower semicontinuous, a rather weak condition in optimization. Hence, our result is applicable even for the case where the subgradient of f does not exist, while in [2–6], f is required, at least, to be subdifferentiable.
3 Convex case
We turn our attention in this section to the case where f and S are convex. In particular, we characterize the concept of weak sharp minima via conjugate function. This way enable us to deal with several different problems, such as convex inequality system and affine convex inclusion. Denote by B the unit ball in ℝ^{n}, i.e., B=\left\{x\in {\mathbb{R}}^{n}\mid \phantom{\rule{2.77695pt}{0ex}}\parallel x\parallel \phantom{\rule{2.77695pt}{0ex}}\le 1\right\}. The following simple result can be found in [12]. The proof is given here for completeness.
Lemma 3.1. Let f be a closed convex function and S be a closed convex set. Then, \stackrel{\u0304}{S} is a set of weak sharp minima if and only if there exists some α > 0 such that
Proof. Using the indicator function, it is easy to see that (1.1) is equivalent to saying the existence of α > 0 such that
Note that the left function is closed convex, since f is proper closed convex and S is closed convex. Therefore, according to LegendreFenchel transform [[13], Theorem 11.1], the above formula can be rewritten equivalently as
which, together with the conjugacy correspondence between support function and indicator function and the fact that \mathsf{\text{dist}}\left(x,\stackrel{\u0304}{S}\right)=\left({\sigma}_{B}\square {\delta}_{\stackrel{\u0304}{S}}\right)\left(x\right) [[14], Section 5], implies
Invoking the positive homogeneity of support function [[14], Theorem 13.2] yields the result as desired. □
Other deep characterizations of weak sharp minima can be found in [15, 16]. Since the concept of weak sharp minima is closely related to error bounds, we shall use the above result to study the error bounds for convex inequality system and affine convex inclusion, respectively.
3.1 Special cases
3.1.1 Convex inequality system
We first consider a convex inequality system as follows
where f_{ i } is a closed convex function and I is an arbitrary (possible infinite) index set. Let f\left(x\right)=\underset{i\in I}{max}\phantom{\rule{2.77695pt}{0ex}}{f}_{i}\left(x\right). Then, the solution set of (3.1) is S = {x ∈ ℝ^{n}f(x) ≤ 0}. We say that (3.1) has a global error bound if there exists α > 0 such that
where f(x)_{+} = max{f (x), 0}.
Theorem 3.2. The system (3.1) has a global error bound if and only if there exists α > 0 such that
where
Proof. Dividing by α in (3.2) and taking the conjugate duality on the both sides yields
where we let g(x) = 0 for all x. According to [[14], Theorem 16.5], we known that
where the second step follows from the fact g* = δ_{{0}}. The desired result follows from [[14], Theorem 16.5]. □
The foregoing result is applicable for the case where the algebra interior of the system (3.1) is empty.
3.1.2 Affine convex inclusion
Consider an affine convex inclusion as follows
where A is a real systemical matrix in ℝ^{n×n}and C ⊆ ℝ^{n} is a nonempty, closed, and convex set. Denote by S the solution set. The system (3.3) is said to has a global error bound if there exists α > 0 such that
Theorem 3.3. Let A be an inverse matrix. Then, the affine convex inclusion has a global error bound if and only if there exists α > 0 with α ≤ 1/A^{1} such that
Proof. Let f(x) = dist(Ax  bC). Taking the conjugate duality on both sides of (3.4) yields
On the other hand, since α ≤ 1/A^{1}, it then follows that
Therefore, for x\in \alpha B, we have
where the last step comes from (3.5). This completes the proof. □
When C is negative orthant, the concept of global error bounds for affine convex inclusion is also referred to as Hoffman bounds in honor of his seminal work [17]. Historically, this is the most intensively studied case. We do not attempt a review of the enormous literature on this case or even on the slightly more general polyhedral case. Rather, our focus is on the case where C is only assumed to be convex.
As mentioned in Introduction, the concept of weak sharp minima plays an important role in the convergence analysis of optimization algorithm. Hence, we investigate the impact of weak sharp minima for solving variational inequality problem (VIP), which is to find a vector x* ∈ X such that
where X is a nonempty closed convex set in ℝ^{n} and F is a mapping from X into ℝ^{n}. Denote by X* the solution set of (VIP). Due to the absence of objective function in (VIP), Marcotte and Zhu [18] adopted the following geometric characterization as the definition of weak sharpness, i.e, the solution set X^{_} of VIP is said to be weakly sharp if
Here, we further introduce two extended version, uniformly weak sharp minima and locally weakly sharp. More precisely, we say that X* is a uniformly weak sharp minima of VIP if there exists α > 0 such that
We say that \stackrel{\u0304}{x}\in {X}^{*} is locally weakly sharp of VIP if there exists δ > 0 such that
Clearly, (3.8) is weaker than (3.6), because the latter corresponds to δ = ∞ and \stackrel{\u0304}{x} must be taken over whole solution set X*.
Theorem 3.4. Let {x^{k}} ⊂ X be a iterative sequence generalized by some algorithm. If either
(i). X* is uniformly weakly sharp, and
where z^{k} ∈ P_{ X * }(x^{k}); or
(ii). {x^{k}} converges to some \stackrel{\u0304}{x}\in {X}^{*}, \stackrel{\u0304}{x} is locally weakly sharp, and F is continuous over X;
then x^{k} ∈ X* for all k sufficiently large if and only if
Proof. The necessity is trial, since x^{k} ∈ X* is equivalent to saying F(x^{k}) ∈ N_{ X }(x^{k}), which further implies that {P}_{{T}_{X}\left({x}^{k}\right)}\left(F\left({x}^{k}\right)\right)=0.
We now show the sufficiency. First assume that (i) holds. Suppose, on the contrary, that there exists a subsequence {\left\{{x}^{k}\right\}}_{\mathcal{K}} such that x^{k} ∉ X* for all k\in \mathcal{K}, where \mathcal{K} is an infinite subset of {1, 2, ...}. For any k\in \mathcal{K}, there exists z^{k} ∈ X* (not necessarily unique) such that x^{k}  z^{k} = dist(x^{k}, X*), i.e., z^{k} ∈ P_{ X* }(x^{k}). Note that {x}^{k}{z}^{k}\in {\widehat{N}}_{{X}^{*}}\left({z}^{k}\right) by [[13], Example 6.16] and that {\widehat{N}}_{{X}^{*}}\left({z}^{k}\right)\subseteq {N}_{{X}^{*}}\left({z}^{k}\right) by [[13], Proposition 6.5]. It then follows that x^{k}  z^{k} ∈ N_{ X * }(z^{k}) ∩ T_{ X }(z^{k}) and z^{k}  x^{k} ∈ T_{ X }(x^{k}).
Invoking (3.7), i.e., there exists α > 0 such that
which further implies
Therefore,
Taking the limit as k\in \mathcal{K} approaches ∞, it follows from (3.9) and (3.10) that α ≤ 0, which leads to a contradiction.
If the condition (ii) holds, we must have, as shown above, that z^{k} converges to \stackrel{\u0304}{x} as well, since \parallel {z}^{k}\stackrel{\u0304}{x}\parallel \le \parallel {z}^{k}{x}^{k}\parallel \phantom{\rule{2.77695pt}{0ex}}+\phantom{\rule{2.77695pt}{0ex}}\parallel {x}^{k}\stackrel{\u0304}{x}\parallel \le 2\parallel {x}^{k}\stackrel{\u0304}{x}\parallel. Hence, as k is large enough, we must have {z}^{k}\in B\left(\stackrel{\u0304}{x},\delta \right). Thus, (3.8) means the existence of α > 0 such that
Since F is continuous, then \parallel F\left({x}^{k}\right)F\left({z}^{k}\right)\parallel \le \parallel F\left({x}^{k}\right)F\left(\stackrel{\u0304}{x}\right)\parallel \phantom{\rule{2.77695pt}{0ex}}+\phantom{\rule{2.77695pt}{0ex}}\parallel F\left({z}^{k}\right)F\left(\stackrel{\u0304}{x}\right)\parallel \to 0 as k → ∞. Hence, using the argument following (3.11) by replacing z^{k} by \stackrel{\u0304}{x} (in the left of (3.11)) yields a contradiction. This completes the proof. □
Finally, let us compare our result with that given in [18], where the finite termination property is established under the assumption that (i) F is pseudomonotone^{+}, i.e., for any x, y ∈ X
and

(ii)
X* is weak sharp minima; (iii) dist(x^{k}X*) converges to zero, and F is uniformly continuous over some open set containing x^{k} and X*. Indeed, according to [[18], Theorem 3.1], we know that F is a constant over X* when F is pseudomonotone^{+}. Using this fact, the concept of uniformly weak sharp minima reduces to weak sharp minima. Meanwhile, it is easy to see that condition (iii) given in [18] implies (3.9). In addition, we further consider the case when x^{k} has a limit point under a weaker version of weak sharp minima.
References
Burke JV, Ferris MC: Weak sharp minima in mathematical programming. SIAM J Control Optim 1993, 31: 1340–1359. 10.1137/0331063
Ng KF, Zheng XY: Global weak sharp minima on Banach spaces. SIAM J Control Optim 2003, 41: 1868–1885. 10.1137/S0363012901389469
Studniarski M, Ward DE: Weak sharp minima: characterizations and sufficient conditions. SIAM J Control Optim 1999, 38: 219–236. 10.1137/S0363012996301269
Zheng XY, Yang XQ: Weak sharp minima for semiinfinite optimization problems with applications. SIAM J Optim 2007, 18: 573–588. 10.1137/060670213
Zheng XY, Ng KF: Subsmooth semiinfinite and infinite optimization problems. Math Program doi: 10.1007/s10107–011–0440–8
Burke JV, Deng S: Weak sharp minima revisited, part I: basic theory. Control Cybern 2002, 31: 439–469.
Burke JV, Deng S: Weak sharp minima revisited, part II: application to linear regularity and error bounds. Math Program 2005, 104: 235–261. 10.1007/s1010700506152
Burke JV, Deng S: Weak sharp minima revisited, Part III: error bounds for differentiable convex inclusions. Math Program 2009, 116: 37–56. 10.1007/s1010700701308
Rückmann JJ, Gómez JA: On generalized semiinfinite programming. TOP 2006, 14: 1–32. 10.1007/BF02578994
Still G: Generalized semiinfinite programming: theory and methods. Euro J Oper Res 1999, 119: 301–313. 10.1016/S03772217(99)001320
Still G: Generalized semiinfinite programming: numerical aspects. Optimization 2001, 49: 223–242. 10.1080/02331930108844531
Zhou JC, Wang CY: New characterizations of weak sharp minima. Optim Lett doi: 10.1007/s1159–011–0369–0
Rockafellar RT, Wets RJ: Variational Analysis. Springer, New York; 1998.
Rockafellar RT: Convex Analysis. Princeton University Press, Princeton; 1970.
Cornejo O, Jourani A, Zalinescu C: Conditioning and upperlipschitz inverse subdifferentials in nonsmooth optimization problem. J Optim Theory Appl 1997, 95: 127–148. 10.1023/A:1022687412779
Zalinescu C: Weak sharp minima, wellbehaving functions and global error bounds for convex inequalities in Banach spaces. In Proceedings of the 12th Baikal International Conference on Optimization Methods and Their Applications. Irkutsk, Russia; 2001:272–284.
Hoffman AJ: On approximate solutions to systems of linear inequalities. J Res Nat Bur Stand 1952, 49: 263–265.
Marcotte P, Zhu DZ: Weak sharp solutions of variational inequalities. SIAM J Optim 1998, 9: 179–189. 10.1137/S1052623496309867
Acknowledgements
Research of Jinchuan Zhou was partially supported by National Natural Science Foundation of China (11101248, 11026047) and Shandong Province Natural Science Foundation (ZR2010AQ026). Research of Xiuhua Xu was partially supported by National Natural Science Foundation of China (11171247). The authors gratefully indebted to anonymous referees for their valuable suggestions and remarks, which essentially improved the presentation of the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors' contributions
Consider the concept of weak sharp minima from a new perspective. The convex and nonconvex cases are treated separately. For the nonconvex case, we establish the relation between weak sharp minima and the generalized semiinfinite programming; for the convex case, we study the convex inequality system and affine convex inclusion in a unified way. As applications, we introduce two new version of weak sharp minima for VIP and develop the corresponding finite termination property, respectively. All authors read and approved the final manuscript.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Zhou, J., Xu, X. Equivalent properties of global weak sharp minima with applications. J Inequal Appl 2011, 137 (2011). https://doi.org/10.1186/1029242X2011137
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/1029242X2011137