Quantitative characterizations of regularity properties of collections of sets
- Authors: Kruger, Alexander , Thao, Nguyen
- Date: 2015
- Type: Text , Journal article
- Relation: Journal of Optimization Theory and Applications Vol. 164, no. 1 (2015), p. 41-67
- Relation: http://purl.org/au-research/grants/arc/DP110102011
- Full Text:
- Reviewed:
- Description: Several primal and dual quantitative characterizations of regularity properties of collections of sets in normed linear spaces are discussed. Relationships between regularity properties of collections of sets and those of set-valued mappings are provided.
About [q]-regularity properties of collections of sets
- Authors: Kruger, Alexander , Thao, Nguyen
- Date: 2014
- Type: Text , Journal article
- Relation: Journal of Mathematical Analysis and Applications Vol. 416, no. 2 (2014), p. 471-496
- Relation: http://purl.org/au-research/grants/arc/DP110102011
- Full Text:
- Reviewed:
- Description: We examine three primal space local Holder type regularity properties of finite collections of sets, namely, [q]-semiregularity, [q]-subregularity, and uniform [q]-regularity as well as their quantitative characterizations. Equivalent metric characterizations of the three mentioned regularity properties as well as a sufficient condition of [q]-subregularity in terms of Frechet normals are established. The relationships between [q]-regularity properties of collections of sets and the corresponding regularity properties of set-valued mappings are discussed.
- Description: We examine three primal space local Holder type regularity properties of finite collections of sets, namely, [q]-semiregularity, [q]-subregularity, and uniform [q]-regularity as well as their quantitative characterizations. Equivalent metric characterizations of the three mentioned regularity properties as well as a sufficient condition of [q]-subregularity in terms of Frechet normals are established. The relationships between [q]-regularity properties of collections of sets and the corresponding regularity properties of set-valued mappings are discussed. (C) 2014 Elsevier Inc. All rights reserved.
An induction theorem and nonlinear regularity models
- Authors: Khanh, Phan , Kruger, Alexander , Thao, Nguyen
- Date: 2015
- Type: Text , Journal article
- Relation: Siam Journal on Optimization Vol. 25, no. 4 (2015), p. 2561-2588
- Relation: http://purl.org/au-research/grants/arc/DP110102011
- Full Text:
- Reviewed:
- Description: A general nonlinear regularity model for a set-valued mapping F : X x R+ paired right arrows Y, where X and Y are metric spaces, is studied using special iteration procedures, going back to Banach, Schauder, Lyusternik, and Graves. Namely, we revise the induction theorem from Khanh [J. Math. Anal. Appl., 118 (1986), pp. 519-534] and employ it to obtain basic estimates for exploring regularity/openness properties. We also show that it can serve as a substitution for the Ekeland variational principle when establishing other regularity criteria. Then, we apply the induction theorem and the mentioned estimates to establish criteria for both global and local versions of regularity/openness properties for our model and demonstrate how the definitions and criteria translate into the conventional setting of a set-valued mapping F : X paired right arrows Y. An application to second-order necessary optimality conditions for a nonsmooth set-valued optimization problem with mixed constraints is provided.
Set regularities and feasibility problems
- Authors: Kruger, Alexander , Luke, Russell , Thao, Nguyen
- Date: 2018
- Type: Text , Journal article
- Relation: Mathematical Programming Vol. 168, no. 1-2 (2018), p. 279-311
- Relation: http://purl.org/au-research/grants/arc/DP160100854
- Full Text:
- Reviewed:
- Description: We synthesize and unify notions of regularity, both of individual sets and of collections of sets, as they appear in the convergence theory of projection methods for consistent feasibility problems. Several new characterizations of regularities are presented which shed light on the relations between seemingly different ideas and point to possible necessary conditions for local linear convergence of fundamental algorithms