About subtransversality of collections of sets
- Authors: Kruger, Alexander , Luke, Russell , Thao, Nguyen
- Date: 2017
- Type: Text , Journal article
- Relation: Set-Valued and Variational Analysis Vol. 25, no. 4 (2017), p. 701-729
- Relation: http://purl.org/au-research/grants/arc/DP160100854
- Full Text:
- Reviewed:
- Description: We provide dual sufficient conditions for subtransversality of collections of sets in an Asplund space setting. For the convex case, we formulate a necessary and sufficient dual criterion of subtransversality in general Banach spaces. Our more general results suggest an intermediate notion of subtransversality, what we call weak intrinsic subtransversality, which lies between intrinsic transversality and subtransversality in Asplund spaces.
Holder error bounds and holder calmness with applications to convex semi-infinite optimization
- Authors: Kruger, Alexander , Lopez, Marco , Yang, Xiaoqi , Zhu, Jiangxing
- Date: 2019
- Type: Text , Journal article
- Relation: Set-Valued and Variational Analysis Vol. 27, no. 4 (Dec 2019), p. 995-1023
- Full Text:
- Reviewed:
- Description: Using techniques of variational analysis, necessary and sufficient subdifferential conditions for Holder error bounds are investigated and some new estimates for the corresponding modulus are obtained. As an application, we consider the setting of convex semi-infinite optimization and give a characterization of the Holder calmness of the argmin mapping in terms of the level set mapping (with respect to the objective function) and a special supremum function. We also estimate the Holder calmness modulus of the argmin mapping in the framework of linear programming.